Lupa

Show document Help

A- | A+ | Print
Title:On cubic polycirculant nut graphs
Authors:ID Bašić, Nino (Author)
ID Damnjanović, Ivan (Author)
Files:.pdf RAZ_Basic_Nino_2025.pdf (581,83 KB)
MD5: BF277F4DDD8652434F814319A5E120B7
 
URL https://link.springer.com/article/10.1007/s40314-025-03218-7
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
Abstract:A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\ell$ vertex orbits of equal size. It is not difficult to observe that there exists no cubic $1$-circulant nut graph or cubic $2$-circulant nut graph, while the full classification of all the cubic $3$-circulant nut graphs was recently obtained (Damnjanović et al. in Electron. J. Comb. 31(2):P2.31, 2024). Here, we investigate the existence of cubic $\ell$-circulant nut graphs for $\ell \geq 4$ and show that there is no cubic $4$-circulant nut graph or cubic $5$-circulant nut graph by using a computer-assisted proof. Furthermore, we rely on a construction based approach in order to demonstrate that there exist infinitely many cubic $\ell$-circulant nut graphs for any fixed $\ell \in \{6, 7\}$ or $\ell \geq 9$.
Keywords:nut graph, polycirculant graph, cubic graph, pregraph, voltage graph
Publication date:06.05.2025
Year of publishing:2025
Number of pages:str. 1-18
Numbering:Vol. 44, iss. 5, article no. 265
PID:20.500.12556/RUP-22123 This link opens in a new window
UDC:519.17
ISSN on article:2238-3603
DOI:10.1007/s40314-025-03218-7 This link opens in a new window
COBISS.SI-ID:257859075 This link opens in a new window
Publication date in RUP:19.11.2025
Views:271
Downloads:5
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Computational & Applied Mathematics
Shortened title:Comput. Appl. Math.
Publisher:Sociedade Brasileira de Matemática Aplicada e Computacional.
ISSN:2238-3603
COBISS.SI-ID:73925379 This link opens in a new window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0294
Name:Računsko intenzivne metode v teoretičnem računalništvu, diskretni matematiki, kombinatorični optimizaciji ter numerični analizi in algebri z uporabo v naravoslovju in družboslovju

Secondary language

Language:Slovenian
Keywords:orešni graf, policirkulantni graf, kubični graf, predgraf, napetostni graf


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica