Spectral arbitrariness for trees fails spectacularly
From MaRDI portal
Publication:6615753
DOI10.1016/j.jctb.2024.06.007zbMath1548.05208MaRDI QIDQ6615753
Seth A. Meyer, Shaun M. Fallat, Polona Oblak, Rupert H. Levene, H. Tracy Hall, Helena Šmigoc, Shahla Nasserasr
Publication date: 8 October 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Questions, conjectures, and data about multiplicity lists for trees
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Zero forcing parameters and minimum rank problems
- Smith normal form and acyclic matrices
- Combinatorially symmetric matrices
- Inverse eigenvalue problems for Jacobi matrices
- Construction of a Jacobi matrix from spectral data
- 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 possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- Geometric Parter-Wiener, etc. theory
- The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
- On the construction of a Jacobi matrix from spectral data
- Computation of minimal rank and path cover number for certain graphs
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Rigid linkages and partial zero forcing
- The inverse eigenvalue problem for linear trees
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
- On the inverse eigenvalue problem for block graphs
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Zero forcing sets and the minimum rank of graphs
- Minimum-rank matrices with prescribed graph
- The degree of the highest common factors of two polynomials.
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- Matrix Analysis
- 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
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- Inverse Problems and Zero Forcing for Graphs
This page was built for publication: Spectral arbitrariness for trees fails spectacularly