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

• Дата: 2019
• Автори: Das, P. K., Singh, K. R.
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2019
• Теми: graphoidal cover; graphoidal covering number; graphoidal graph; self-graphoidal graph; 05C38; 05C75
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/149
• Назва журналу: Algebra and Discrete Mathematics

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