5 papers
Bipartite edge frustration of nut graphs: proofs and constructions
Nino Bašić, Patrick W. Fowler
The bipartite edge frustration of a graph , , is the minimum number of edges that must be removed from to obtain a graph that is bipartite. Core graphs are singular gr…
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…
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…
Nut graphs with a given automorphism group
Nino Bašić, Patrick W. Fowler
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are…
Vertex and edge orbits in nut graphs
Nino Bašić, Patrick W. Fowler, Tomaž Pisanski
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. If the isolated vertex is e…