ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A circulant nut graph C(n,S)C(n,S) is a circulant graph on nn vertices whose adjacency matrix has nullity one and whose nullvector has no zero entries; here S={a1,a2,…,a6}S=\{a_1,a_2,\dots,a_6\} specifies the six positive circulant steps, giving degree 1212. The 12-regular circulant nut graph conjecture. For every even nn, n≥16n\ge 16, there exists a circulant nut graph C(n,{a1,a2,…,a6})C(n,\{a_1,a_2,\dots,a_6\}) of degree 1212. The conjecture extends the explicitly constructed examples for several even orders between 1616 and 3838 and asks for such a graph at every even order at least 1616.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.