3 papers
math.CO2025
Nut digraphs
Nino Bašić, Patrick W. Fowler, Maxine M. McCarthy +1
A nut graph is a simple graph whose kernel is spanned by a single full vector (i.e. the adjacency matrix has a single zero eigenvalue and all non-zero kernel eigenvectors have no z…
math.CO2025
Nut graphs with a prescribed number of vertex and edge orbits
Nino Bašić, Ivan Damnjanović
A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more…
math.CO2024
On cubic polycirculant nut graphs
Nino Bašić, Ivan Damnjanović
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 -circulant graph…