Distinct eigenvalues are realizable with generic eigenvectors

DOI10.1080/03081087.2023.2232090MaRDI QIDQ6608152zbMATH OpenFDO

Authors Rupert H. Levene, Polona Oblak, Helena Šmigoc

Publication date 19 September 2024

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/03081087.2023.2232090

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)

Recommendations

• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• The nowhere-zero eigenbasis problem for a graph
• Graphs that allow all the eigenvalue multiplicities to be even
• 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.
• The inverse eigenvalue problem of a graph: multiplicities and minors

Cites work

• A characterization of tridiagonal matrices
• A lower bound for the number of distinct eigenvalues of some real symmetric matrices
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Construction of nonnegative matrices and the inverse eigenvalue problem
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• 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.
• Minimum number of distinct eigenvalues of graphs
• On the inverse eigenvalue problem for block graphs
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Orthogonal symmetric matrices and joins of graphs
• Spectra of principal submatrices of nonnegative matrices
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
• The inverse eigenvalue problem for linear trees
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The nowhere-zero eigenbasis problem for a graph

Cited in

(2)

• Graphs with bipartite complement that admit two distinct eigenvalues
• Inverse eigenvalue problem for discrete Schrödinger operators of a graph

This page was built for publication: Distinct eigenvalues are realizable with generic eigenvectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608152)