Show simple item record

dc.contributor.authorAhmadi, Bahman
dc.contributor.authorAlinaghipour, Fatemeh
dc.contributor.authorCavers, Michael
dc.contributor.authorFallat, Shaun
dc.contributor.authorMeagher, Karen
dc.contributor.authorNasserasr, Shahla
dc.date.accessioned2015-05-12T16:32:03Z
dc.date.available2015-05-12T16:32:03Z
dc.date.issued2013-09
dc.identifier.issn1081-3810
dc.identifier.urihttp://hdl.handle.net/10294/5684
dc.description.abstractThe minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to deduce further properties of q(G). It is shown that there is a great number of graphs G for which q(G) = 2. For some families of graphs, such as the join of a graph with itself, complete bipartite graphs, and cycles, this minimum value is obtained. Moreover, examples of graphs G are provided to show that adding and deleting edges or vertices can dramatically change the value of q(G). Finally, the set of graphs G with q(G) near the number of vertices is shown to be a subset of known families of graphs with small maximum multiplicity.en_US
dc.description.sponsorshipNSERCen_US
dc.language.isoenen_US
dc.publisherInternational Linear Algebra Societyen_US
dc.subjectdiameteren_US
dc.subjecteigenvalueen_US
dc.titleMinimum number of distinct eigenvalues of graphsen_US
dc.typeArticleen_US
dc.description.authorstatusFacultyen_US
dc.description.peerreviewyesen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record