Minimum number of distinct eigenvalues of graphs
From MaRDI portal
Publication:5746835
DOI10.13001/1081-3810.1679zbMath1282.05085arXiv1304.1205OpenAlexW90744597MaRDI QIDQ5746835
Shahla Nasser, Shaun M. Fallat, Karen Meagher, Fatemeh Alinaghipour, Michael S. Cavers, Bahman Ahmadi
Publication date: 10 February 2014
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.1205
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (30)
Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph ⋮ An explicit upper bound on disparity for trees of a given diameter ⋮ The nowhere-zero eigenbasis problem for a graph ⋮ On the minimum number of distinct eigenvalues of a threshold graph ⋮ The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Tight Frame Graphs Arising as Line Graphs ⋮ Orthogonal symmetric matrices and joins of graphs ⋮ The strong spectral property for graphs ⋮ Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs ⋮ Regular graphs of degree at most four that allow two distinct eigenvalues ⋮ The strong spectral property of graphs: graph operations and barbell partitions ⋮ Sparsity of graphs that allow two distinct eigenvalues ⋮ Diminimal families of arbitrary diameter ⋮ The allow sequence of distinct eigenvalues for a sign pattern ⋮ On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph ⋮ Graphs that allow all the eigenvalue multiplicities to be even ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ On the inverse eigenvalue problem for block graphs ⋮ The inverse eigenvalue problem of a graph: multiplicities and minors ⋮ Frame graph ⋮ Sign patterns of orthogonal matrices and the strong inner product property ⋮ Unnamed Item ⋮ Rigid linkages and partial zero forcing ⋮ Unnamed Item ⋮ Achievable multiplicity partitions in the inverse eigenvalue problem of a graph ⋮ On Orthogonal Matrices with Zero Diagonal ⋮ Minimum number of distinct eigenvalues allowed by a sign pattern ⋮ A theorem on the number of distinct eigenvalues
This page was built for publication: Minimum number of distinct eigenvalues of graphs
