On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
From MaRDI portal
(Redirected from Publication:869912)
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
(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
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
- Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
- 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)