Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
classification
🧮 math.CO
keywords
distincteigenvaluesminimumnumbergraphgraphsanalysisapplications
read the original abstract
We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues of several families of graphs and small graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.