Classification of cubic tricirculant nut graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929356138348544 |
|---|---|
| author | Damnjanović, Ivan Bašić, Nino Pisanski, Tomaž Žitnik, Arjana |
| author_facet | Damnjanović, Ivan Bašić, Nino Pisanski, Tomaž Žitnik, Arjana |
| contents | A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that there exist no cubic circulant nut graphs. A bicirculant (resp. tricirculant) graph is defined as a graph that admits a cyclic group of automorphisms having two (resp. three) orbits of vertices of equal size. We show that there exist no cubic bicirculant nut graphs and we provide a full classification of cubic tricirculant nut graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_14884 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Classification of cubic tricirculant nut graphs Damnjanović, Ivan Bašić, Nino Pisanski, Tomaž Žitnik, Arjana Combinatorics Number Theory 05C50, 11C08, 12D05 A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that there exist no cubic circulant nut graphs. A bicirculant (resp. tricirculant) graph is defined as a graph that admits a cyclic group of automorphisms having two (resp. three) orbits of vertices of equal size. We show that there exist no cubic bicirculant nut graphs and we provide a full classification of cubic tricirculant nut graphs. |
| title | Classification of cubic tricirculant nut graphs |
| topic | Combinatorics Number Theory 05C50, 11C08, 12D05 |
| url | https://arxiv.org/abs/2312.14884 |