Answers are grounded in this paper and cite their sources.
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all nonzero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group can be represented as the group of automorphisms of infinitely many nut graphs. It is further shown that such nut graphs exist even within the class of regular graphs; the cases where the degree is 8, 12, 16, 20 or 24 are realised explicitly.
No takes yet. Share an insight, caveat, or question.
Bašić et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: