|
Algebra and Discrete Mathematics, 2018, том 26, выпуск 2, страницы 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
Аннотация:
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.
Поступила в редакцию: 21.01.2016 Исправленный вариант: 06.11.2018
Образец цитирования:
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
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/adm681 https://www.mathnet.ru/rus/adm/v26/i2/p247
|
Статистика просмотров: |
Страница аннотации: | 186 | PDF полного текста: | 65 | Список литературы: | 30 |
|