Nut graph (graph theory)

In graph theory, a nut graph is a finite simple graph with at least two vertices whose adjacency matrix has a nullity equal to one and whose kernel is spanned by a vector with no zero entries. This class of graphs was introduced by Irene Sciriha and Iván Gutman in 1998. Nut graphs arise frequently in spectral graph theory and chemical graph theory.