3 papers
math.CO2025
The Möbius-Kantor graph is a faithful unit-distance graph
Nino BaÅ¡iÄ, Gábor Gévay, Tomaž Pisanski
In this paper, it has been shown that the generalized Petersen graph , also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in…
math.CO2025
On the degrees of regular nut graphs and Cayley nut graphs
Nino BaÅ¡iÄ, Ivan DamnjanoviÄ, Patrick W. Fowler
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely…
math.CO2025
Classification of quartic bicirculant nut graphs
Ivan DamnjanoviÄ, Nino BaÅ¡iÄ, Tomaž Pisanski +1
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 automorp…