On a graph isomorphic to its intersection graph: self-graphoidal graphs
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...
Збережено в:
| Дата: | 2019 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2019
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/149 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematics| id |
oai:ojs.admjournal.luguniv.edu.ua:article-149 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-1492019-01-24T08:21:31Z On a graph isomorphic to its intersection graph: self-graphoidal graphs Das, P. K. Singh, K. R. graphoidal cover, graphoidal covering number, graphoidal graph, self-graphoidal graph 05C38, 05C75 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. Lugansk National Taras Shevchenko University 2019-01-24 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/149 Algebra and Discrete Mathematics; Vol 26, No 2 (2018) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/149/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/149/439 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/149/459 Copyright (c) 2019 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| baseUrl_str |
|
| datestamp_date |
2019-01-24T08:21:31Z |
| collection |
OJS |
| language |
English |
| topic |
graphoidal cover graphoidal covering number graphoidal graph self-graphoidal graph 05C38 05C75 |
| spellingShingle |
graphoidal cover graphoidal covering number graphoidal graph self-graphoidal graph 05C38 05C75 Das, P. K. Singh, K. R. On a graph isomorphic to its intersection graph: self-graphoidal graphs |
| topic_facet |
graphoidal cover graphoidal covering number graphoidal graph self-graphoidal graph 05C38 05C75 |
| format |
Article |
| author |
Das, P. K. Singh, K. R. |
| author_facet |
Das, P. K. Singh, K. R. |
| author_sort |
Das, P. K. |
| title |
On a graph isomorphic to its intersection graph: self-graphoidal graphs |
| title_short |
On a graph isomorphic to its intersection graph: self-graphoidal graphs |
| title_full |
On a graph isomorphic to its intersection graph: self-graphoidal graphs |
| title_fullStr |
On a graph isomorphic to its intersection graph: self-graphoidal graphs |
| title_full_unstemmed |
On a graph isomorphic to its intersection graph: self-graphoidal graphs |
| title_sort |
on a graph isomorphic to its intersection graph: self-graphoidal graphs |
| description |
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. |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2019 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/149 |
| work_keys_str_mv |
AT daspk onagraphisomorphictoitsintersectiongraphselfgraphoidalgraphs AT singhkr onagraphisomorphictoitsintersectiongraphselfgraphoidalgraphs |
| first_indexed |
2025-07-17T10:30:05Z |
| last_indexed |
2025-07-17T10:30:05Z |
| _version_ |
1837889818257784832 |