On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
From MaRDI portal
Publication:1601616
Recommendations
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- On the multiplicity of eigenvalues of trees
- A note on the multiplicities of the eigenvalues of a tree
- Multiplicities of eigenvalues and tree-width of graphs
- Eigenvalues of matrices with tree graphs
Cites work
- Inequalities: theory of majorization and its applications
- Inverse Eigenvalue Problems
- Matrix Analysis
- Mechanical vibration trees
- Minimum-rank matrices with prescribed graph
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- 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
(47)- Eigenvalues, multiplicities and graphs
- On the relationship between the multiplicities of eigenvalues in finite- and infinite-dimensional problems on graphs
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
- On the eigenvalues of generalized and double generalized stars
- On multiplicities of eigenvalues of a spectral problem on a prolate tree
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
- The number of interlacing equalities resulting from removal of a vertex from a tree
- The change in multiplicity of an eigenvalue due to adding or removing edges
- Unordered multiplicity lists of a class of binary trees
- On multiplicities of eigenvalues of a boundary value problem on a snowflake graph
- Multiplicity lists for symmetric matrices whose graphs have few missing edges
- Eigenvalues, multiplicities and graphs
- Sparks of symmetric matrices and their graphs
- Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
- Unitary matrix digraphs and minimum semidefinite rank
- Spectral arbitrariness for trees fails spectacularly
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- A note on the multiplicities of the eigenvalues of a graph
- Location and multiplicities of eigenvalues for a star graph of Stieltjes strings
- Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings
- Patterns with several multiple eigenvalues
- Diminimal families of arbitrary diameter
- The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
- On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
- Unordered multiplicity lists of wide double paths
- On the inverse eigenvalue problem for block graphs
- The minimum rank of symmetric matrices described by a graph: a survey
- On the Hermitian matrices with distinct eigenvalues and its applications
- The number of distinct eigenvalues for which an index decreases multiplicity
- Geometric Parter-Wiener, etc. theory
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
- Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations
- Linearly independent vertices and minimum semidefinite rank
- Questions, conjectures, and data about multiplicity lists for trees
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
- Computation of minimal rank and path cover number for certain graphs
- Multiplicities: adding a vertex to a graph
- Smith normal form and acyclic matrices
- Graphs that allow all the eigenvalue multiplicities to be even
This page was built for publication: On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601616)