The Graphs for which the Maximum Multiplicity of an Eigenvalue is Two

Simple item page
dc.creatorJohnson, Charles R.
dc.creatorLoewy, Raphael
dc.creatorSmith, Paul Anthony
dc.date2007-01-20
dc.date.accessioned2026-07-07T07:42:20Z
dc.date.available2026-07-07T07:42:20Z
dc.descriptionCharacterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general fields), but only certain partial 2-trees guarantee maximum multiplicity 2. Among partial linear 2-trees, they are only those whose vertices can be covered by two "parallel" induced paths. The remaining graphs that guarantee maximum multiplicity 2 are comprised by certain identified families of "exceptional" partial 2-trees that are not linear.
dc.identifierhttps://arxiv.org/abs/math/0701562
dc.identifierhttp://arxiv.org/abs/math/0701562
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122407
dc.subjectCombinatorics
dc.subject05C50; 15A57
dc.titleThe Graphs for which the Maximum Multiplicity of an Eigenvalue is Two
dc.typetext

Files

Collections

arXiv