On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree

From MaRDI portal
Publication:1601616

DOI10.1016/S0024-3795(01)00522-5zbMath1001.15004MaRDI QIDQ1601616

Charles R. Johnson, António Leal-Duarte

Publication date: 27 June 2002

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




Related Items (34)

On multiplicities of eigenvalues of a spectral problem on a prolate treeThe change in multiplicity of an eigenvalue due to adding or removing edgesLinearly independent vertices and minimum semidefinite rankThe inverse inertia problem for graphs: Cut vertices, trees, and a counterexampleComputation of minimal rank and path cover number for certain graphsQuestions, conjectures, and data about multiplicity lists for treesMultiplicities: Adding a Vertex to a GraphThe maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graphOrdered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear treeOn multiplicities of eigenvalues of a boundary value problem on a snowflake graphNoncrossing partitions, noncrossing graphs, and \(q\)-permanental equationsThe implicit construction of multiplicity lists for classes of trees and verification of some conjecturesDiminimal families of arbitrary diameterSparks of symmetric matrices and their graphsBranch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a treeDirichlet-Neumann inverse spectral problem for a star graph of Stieltjes stringsInverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphsOn the eigenvalues of generalized and double generalized starsA note on the multiplicities of the eigenvalues of a graphGraphs that allow all the eigenvalue multiplicities to be evenOn the multiplicities of eigenvalues of a Hermitian matrix whose graph is a treeOn the relationship between the multiplicities of eigenvalues in finite- and infinite-dimensional problems on graphsOn the inverse eigenvalue problem for block graphsUndirected graphs of Hermitian matrices that admit only two distinct eigenvaluesUnitary matrix digraphs and minimum semidefinite rankPatterns with several multiple eigenvaluesThe maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a treeThe minimum rank of symmetric matrices described by a graph: a surveyNumerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a treeSmith normal form and acyclic matricesDiagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignmentsThe Number of Interlacing Equalities Resulting from Removal of a Vertex from a TreeLocation and multiplicities of eigenvalues for a star graph of Stieltjes strings



Cites Work


This page was built for publication: On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree