RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Algebra Discrete Math.: Year: Volume: Issue: Page: Find

 Algebra Discrete Math., 2018, Volume 26, Issue 2, Pages 247–255 (Mi adm681)

RESEARCH ARTICLE

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

Abstract: 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.

Keywords: graphoidal cover, graphoidal covering number, graphoidal graph, self-graphoidal graph.

Full text: PDF file (322 kB)
References: PDF file   HTML file
MSC: 05C38, 05C75
Revised: 06.11.2018
Language:

Citation: 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
\Bibitem{DasSin18}
\by P.~K.~Das, K.~R.~Singh
\paper On a~graph isomorphic to its intersection graph: self-graphoidal graphs
\jour Algebra Discrete Math.
\yr 2018
\vol 26
\issue 2
\pages 247--255