The graphs for which the maximum multiplicity of an eigenvalue is two

DOI10.1080/01445340802354580zbMath1225.05167arXivmath/0701562MaRDI QIDQ3399125

Charles R. Johnson, Raphael Loewy, Paul Smith

Publication date: 29 September 2009

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0701562

zbMATH Keywords

graph; eigenvalue; partial 2-tree; minimum rank of a graph; exceptional partial 2-tree; linear partial 2-tree

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

15B57: Hermitian, skew-Hermitian, and related matrices

Related Items

Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph, A technique for computing the zero forcing number of a graph with a cut-vertex, On the minimum rank of a graph over finite fields, The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample, The minimum rank of symmetric matrices described by a graph: a survey, On the relationships between zero forcing numbers and certain graph coverings

Cites Work

• Graphs whose positive semi-definite matrices have nullity at most two
• On Fiedler's characterization of tridiagonal matrices over arbitrary fields
• Computation of minimal rank and path cover number for certain graphs
• A characterization of tridiagonal matrices
• Steiner trees, partial 2–trees, and minimum IFI networks
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree