On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle

DOI10.1016/J.LAA.2006.06.030MaRDI QIDQ869912zbMATH OpenOpenAlexFDO

Authors Rosário Fernandes

Publication date 9 March 2007

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2006.06.030

zbMATH Keywords

eigenvaluesHermitian matrices

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Review text

\textit{C. R. Johnson} and \textit{A. L. Duarte} [Linear Multilinear Algebra 46, No. 1--2, 139--144 (1999; Zbl 0929.15005)] proved that for trees \(G\) the maximum possible multiplicity \(M(G)\) of an eigenvalue of a Hermitian matrix whose graph is \(G\) equals the path-covering number of \(G\). The present paper establishes analogous results for some cases of matrices \(G\) whose graph contains exactly one cycle, relating \(M(G)\) to certain parameters associated with \(G\).

Recommendations

• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• A note on the multiplicities of graph eigenvalues

Cites work

• Computation of minimal rank and path cover number for certain graphs
• Matrix Analysis
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Problems in algebraic combinatorics
• Spectral multiplicity and splitting results for a class of qualitative matrices
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

Cited in

(9)

• The number of P-vertices in a matrix with maximum nullity
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
• A note on the multiplicities of graph eigenvalues
• The minimum rank of matrices and the equivalence class graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree

This page was built for publication: On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869912)