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.
From MaRDI portal
Publication:1414148
DOI10.1016/S0024-3795(03)00582-2zbMath1035.15010OpenAlexW2083424945MaRDI QIDQ1414148
Charles R. Johnson, Carlos M. Saiago, António Leal-Duarte
Publication date: 19 November 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(03)00582-2
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)
Related Items (38)
On multiplicities of eigenvalues of a spectral problem on a prolate tree ⋮ Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph ⋮ The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Questions, conjectures, and data about multiplicity lists for trees ⋮ Further generalization of symmetric multiplicity theory to the geometric case over a field ⋮ Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue ⋮ Unordered multiplicity lists of a class of binary trees ⋮ Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree ⋮ On multiplicities of eigenvalues of a boundary value problem on a snowflake graph ⋮ Two inverse eigenvalue problems for matrices whose graphs are trees ⋮ Multiplicity lists for symmetric matrices whose graphs have few missing edges ⋮ Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree ⋮ The liberation set in the inverse eigenvalue problem of a graph ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree ⋮ Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree ⋮ On the Laplacian spectra of graphs with pockets ⋮ On the eigenvalues of generalized and double generalized stars ⋮ On the inverse eigenvalue problem for block graphs ⋮ The inverse eigenvalue problem of a graph: multiplicities and minors ⋮ The number of \(P\)-vertices in a matrix with maximum nullity ⋮ Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree ⋮ Patterns with several multiple eigenvalues ⋮ The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree ⋮ An interior inverse problem for the diffusion operator ⋮ Diameter minimal trees ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ The number of distinct eigenvalues for which an index decreases multiplicity ⋮ Smith normal form and acyclic matrices ⋮ Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments ⋮ Implicit construction of multiple eigenvalues for trees ⋮ On the inverse eigenvalue problem for a special kind of acyclic matrices. ⋮ Inverse problems for the impulsive Sturm–Liouville operator with jump conditions ⋮ The inverse eigenvalue problem for linear trees ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree ⋮ The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree ⋮ On inverse eigenvalue problems for two kinds of special banded matrices ⋮ Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
Cites Work
- Unnamed Item
- Construction of acyclic matrices from spectral data
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
- Matrix Analysis
- A survey of matrix inverse eigenvalue problems
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Inverse Eigenvalue Problems
- The Parter--Wiener Theorem: Refinement and Generalization
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
This page was built for publication: 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.
