Minimal configurations and interlacing
Irene Sciriha, İvan Gutman · OAR@UM (University of Malta) · 2005
A graph is singular of nullity n if zero is an eigenvalue of its adjacency matrix with multiplicity n. A subgraph that forces a graph to be singular is called a minimal configuration. We show various properties of minimal configurations.