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...
Gespeichert in:
| Datum: | 2019 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2019
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/149 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |