Classification of quartic bicirculant nut graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916606153588736 |
|---|---|
| author | Damnjanović, Ivan Bašić, Nino Pisanski, Tomaž Žitnik, Arjana |
| author_facet | Damnjanović, Ivan Bašić, Nino Pisanski, Tomaž Žitnik, Arjana |
| contents | A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorphism with two equally sized vertex orbits. There are four classes of connected quartic bicirculant graphs. We classify the quartic bicirculant graphs that are nut graphs by investigating properties of each of these four classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_06353 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Classification of quartic bicirculant nut graphs Damnjanović, Ivan Bašić, Nino Pisanski, Tomaž Žitnik, Arjana Combinatorics 05C50, 05C25, 05C75 A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorphism with two equally sized vertex orbits. There are four classes of connected quartic bicirculant graphs. We classify the quartic bicirculant graphs that are nut graphs by investigating properties of each of these four classes. |
| title | Classification of quartic bicirculant nut graphs |
| topic | Combinatorics 05C50, 05C25, 05C75 |
| url | https://arxiv.org/abs/2502.06353 |