Skip to main content
Article
Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
Pure and Applied Functional Analysis
  • 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
Accepted 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 manuscript of an article published as 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." 3, no. 4 Pure and Applied Functional Analysis (2018): 537-563. Posted with permission.

Copyright Owner
Yokohama Publishers
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" Pure and Applied Functional Analysis Vol. 3 Iss. 4 (2018) p. 537 - 563
Available at: http://works.bepress.com/leslie-hogben/84/