Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
On a graph isomorphic to its intersection graph: self-graphoidal graphs
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
On a graph isomorphic to its intersection graph: self-graphoidal graphs
Інший ID:
2010 MSC: 05C38, 05C75.
Посилання:
On a graph isomorphic to its intersection graph: self-graphoidal graphs / P.K. Das, K.R. Singh // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 247–255. — Бібліогр.: 11назв. — англ.
Дата:
2018
Переглядів:
160
Завантажень:
63
Анотація:
A graph G is called a graphoidal graph if there exists a graph H and a graphoidal cover ψ of H such that G ≅ Ω (H, ψ ). 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.
