On a graph isomorphic to its intersection graph: self-graphoidal graphs

• Опубліковано в: : Algebra and Discrete Mathematics
• Дата: 2018
• Автори: Das, P.K., Singh, K.R.
• Формат: Стаття
• Мова: Англійська
• Опубліковано: Інститут прикладної математики і механіки НАН України 2018
• Онлайн доступ: https://nasplib.isofts.kiev.ua/handle/123456789/188411
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Цитувати: 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назв. — англ.

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 fr...