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

From papers

A circulant nut graph is a circulant graph whose adjacency matrix has a one-dimensional null space spanned by a full vector. Let dd be a degree satisfying d40d \equiv_4 0, and let nn be even with nd+4n \ge d+4. Bašić et al.'s conjecture. For every such dd and nn, there exists a circulant nut graph of order nn and degree dd. The conjecture gives a sufficient existence condition matching the necessary condition for vertex-transitive nut graphs in the case that the degree is divisible by four; its resolution is not indicated in the supplied text.

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ć, “A note on Cayley nut graphs whose degree is divisible by four”, arXiv:2305.18658 (2023).

Additional references

4 papers in this index state this conjecture (2021–2023). The statement above is taken from the most recent of them; the others are arXiv:2212.03026, arXiv:2210.08334, arXiv:2102.04418.

Solutions 0

No solutions have been posted yet.