On a graph isomorphic to its intersection graph: self-graphoidal graphs
P. K. Dasa, K. R. Singhb
a Department of Mathematics, KIIT Deemed to be University, Bhubaneswar, 751031, India
b Department of Mathematics, National Institute of Technology, Arunachal Pradesh, 791112, India
A graph $G$ is called a graphoidal graph if there exists a graph $H$ and a graphoidal cover $\psi$ of $H$ such that $G\cong\Omega(H,\psi)$. Then the graph $G$ is said to be self-graphoidal if it is isomorphic to one of its graphoidal graphs. In this paper, we have examined the existence of a few self-graphoidal graphs from path length sequence of a graphoidal cover and obtained new results on self-graphoidal graphs.
graphoidal cover, graphoidal covering number, graphoidal graph, self-graphoidal graph.
PDF file (322 kB)
MSC: 05C38, 05C75
P. K. Das, K. R. Singh, “On a graph isomorphic to its intersection graph: self-graphoidal graphs”, Algebra Discrete Math., 26:2 (2018), 247–255
Citation in format AMSBIB
\by P.~K.~Das, K.~R.~Singh
\paper On a~graph isomorphic to its intersection graph: self-graphoidal graphs
\jour Algebra Discrete Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|