On the minimum number of distinct eigenvalues of a threshold graph

DOI10.1016/j.laa.2022.02.001zbMath1487.05158arXiv2110.10143OpenAlexW4225764986WikidataQ114151888 ScholiaQ114151888MaRDI QIDQ2133671

Seyed Ahmad Mojallal, Shaun M. Fallat

Publication date: 5 May 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.10143

zbMATH Keywords

threshold graphsminimum number of distinct eigenvaluesstrong spectral propertyeigenvalue of graphsvertex-clique incidence matrix

Mathematics Subject Classification ID

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

Related Items (1)

Diminimal families of arbitrary diameter

Cites Work

• The minimum rank of symmetric matrices described by a graph: a survey
• Degree maximal graphs are Laplacian integral
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• On the zero forcing number of a graph involving some classical parameters
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• Spectral graph theory and the inverse eigenvalue problem of a graph
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Minimum number of distinct eigenvalues of graphs
• Unnamed Item

This page was built for publication: On the minimum number of distinct eigenvalues of a threshold graph