Skip to main content
Article
Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
Mathematics Publications
  • Beth Bjorkman, Iowa State University
  • Leslie Hogben, Iowa State University
  • Scarlitte Ponce, Iowa State University
  • Carolyn Reinhart, Iowa State University
  • Theodore Tranel, Iowa State University
Document Type
Article
Publication Version
Submitted Manuscript
Publication Date
1-1-2018
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.

Comments

This is a pre-print of the article Bjorkman, Beth, Leslie Hogben, Scarlitte Ponce, Carolyn Reinhart, and Theodore Tranel. "Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph." arXiv preprint arXiv:1708.01821 (2017).

Language
en
File Format
application/pdf
Citation Information
Beth Bjorkman, Leslie Hogben, Scarlitte Ponce, Carolyn Reinhart, et al.. "Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph" (2018)
Available at: http://0-works.bepress.com.library.simmons.edu/leslie-hogben/84/