The existence conjecture for 12-regular circulant nut graphs
Statement
A circulant nut graph is a circulant graph on vertices whose adjacency matrix has nullity one and whose nullvector has no zero entries; here specifies the six positive circulant steps, giving degree . The 12-regular circulant nut graph conjecture. For every even , , there exists a circulant nut graph of degree . The conjecture extends the explicitly constructed examples for several even orders between and and asks for such a graph at every even order at least .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.