Bašić et al.'s divisible-by-four degree conjecture for circulant nut graphs

From papers

Let nn be the order of a circulant graph, and let Circ(n,S)\mathrm{Circ}(n,S) denote the circulant graph with generator set SS. 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 dd with d0(mod4)d\equiv 0\pmod 4, and for every even nn with nd+4n\geq d+4, there exists a circulant nut graph Circ(n,{a1,a2,a3,,ad/2})\mathrm{Circ}(n,\{a_1,a_2,a_3,\ldots,a_{d/2}\}) of degree dd. This is an existence conjecture for circulant nut graphs of every degree divisible by four; the supplied text gives no resolution status.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ivan Damnjanović, “Two families of circulant nut graphs”, arXiv:2210.08334 (2022).

Solutions 0

No solutions have been posted yet.