Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
From MaRDI portal
Publication:5146250
zbMath1474.15025arXiv1708.01821MaRDI QIDQ5146250
Theodor Tranel, Beth Bjorkman, Scarlitte Ponce, Carolyn Reinhart, Leslie Hogben
Publication date: 25 January 2021
Full work available at URL: https://arxiv.org/abs/1708.01821
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)
Related Items
Tight Frame Graphs Arising as Line Graphs, Ordered multiplicity inverse eigenvalue problem for graphs on six vertices, 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, Sparsity of graphs that allow two distinct eigenvalues, 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, A zero forcing technique for bounding sums of eigenvalue multiplicities, On the inverse eigenvalue problem for block graphs, Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
