Classification of cubic tricirculant nut graphs
Combinatorics
2024-05-27 v1 Number Theory
Abstract
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.
Keywords
Cite
@article{arxiv.2312.14884,
title = {Classification of cubic tricirculant nut graphs},
author = {Ivan Damnjanović and Nino Bašić and Tomaž Pisanski and Arjana Žitnik},
journal= {arXiv preprint arXiv:2312.14884},
year = {2024}
}