1. Graphs with eigenvalues at least −2
- Author
-
Sunil B Rao, N. M. Singhi, and Vijaya Kumar
- Subjects
Discrete mathematics ,Numerical Analysis ,Algebra and Number Theory ,1-planar graph ,Combinatorics ,Indifference graph ,Pathwidth ,Chordal graph ,Partial k-tree ,Discrete Mathematics and Combinatorics ,Cograph ,Split graph ,Geometry and Topology ,Forbidden graph characterization ,Mathematics - Abstract
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is described. It is shown that each minimal forbidden graph has at most 10 vertices and the bound is the best possible.
- Full Text
- View/download PDF