20.500.12556/DiRROS-21311 Classification of cubic tricirculant nut graphs 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. bicirculant tricirculant eigenvalue bicirkulant tricirkulant lastna vrednost true false true Angleški jezik Slovenski jezik Neznano 2025-01-24 13:14:13 2025-01-24 13:14:14 2025-01-25 03:38:07 0000-00-00 00:00:00 2024 0 0 str. 1-32 iss. 2, article no. P2.31 Vol. 31 2024 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2024-01-01 519.17 1077-8926 10.37236/12668 217572099 12668-PDF_file-49646-2-10-20240521.pdf 12668-PDF_file-49646-2-10-20240521.pdf 1 88B8811DDADE9E3E292312B5467A8B1F 6693f5649e83aab481e51cab2878cffed4fce4f4dd8226b951934549789a76f4 2ea95297-da4d-11ef-ba3f-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=30293 https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i2p31 1 bd7f138f-da4c-11ef-ba3f-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=30292 Inštitut za matematiko, fiziko in mehaniko 0 0 0