The allow sequence of distinct eigenvalues for a sign pattern

DOI10.13001/ela.2024.7779WikidataQ129380819 ScholiaQ129380819MaRDI QIDQ6198239

Pauline van den Driessche, Minerva Catral, Michael S. Cavers, Kevin N. Vander Meulen, Unnamed Author, Jane Breen

Publication date: 21 February 2024

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

zbMATH Keywords

eigenvaluedigraphinverse eigenvalue problemdistinct eigenvaluessign pattern

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Sign pattern matrices (15B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Sign patterns that require repeated eigenvalues
• Allow problems concerning spectral properties of sign pattern matrices: a survey
• Potentially nilpotent sign pattern matrices
• Spectrally arbitrary patterns
• Minimum number of distinct eigenvalues allowed by a sign pattern
• The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Allow problems concerning spectral properties of patterns
• Nilpotent matrices and spectrally arbitrary sign patterns
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Techniques for identifying inertially arbitrary patterns
• Minimum number of distinct eigenvalues of graphs
• On the number of terms of a power of a polynomial
• \(4 \times 4\) irreducible sign pattern matrices that require four distinct eigenvalues