Bašić et al.'s divisible-by-four degree conjecture for circulant nut graphs
Let be the order of a circulant graph, and let denote the circulant graph with generator set . A nut graph is a non-trivial graph whose adjacency matrix has nullity one and whose non-zero null-space vectors have no zero elements. Bašić et al.'s conjecture. For every with , and for every even with , there exists a circulant nut graph of degree . This is an existence conjecture for circulant nut graphs of every degree divisible by four; the supplied text gives no resolution status.
References
Primary source
Ivan Damnjanović, “Two families of circulant nut graphs”, arXiv:2210.08334 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.