On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
DOI10.1016/J.LAA.2006.06.030zbMATH Open1121.15013OpenAlexW2008062439MaRDI QIDQ869912FDOQ869912
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Paths and cycles (05C38)
Cites Work
- Matrix Analysis
- Problems in algebraic combinatorics
- Computation of minimal rank and path cover number for certain graphs
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
Cited In (8)
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- The number of \(P\)-vertices in a matrix with maximum nullity
- The minimum rank of matrices and the equivalence class graph
- 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
- On the difference between the maximum multiplicity and path cover number for tree-like graphs
- A note on the multiplicities of graph eigenvalues
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
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)