Cal Poly
Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms
Abstract
dc:description.abstractGraphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, accomplish this but only once some spectral information is already known. A different approach, introduced by Barrett et al. (2015), uses the automorphisms of a graph to block-diagonalise its adjacency matrix without any prior spectral information. Because one of the resulting summands is always the quotient matrix of an equitable partition, this procedure is called an equitable decomposition.
Degree
thesis:*- Name thesis:degree_name
- MS in Mathematics
- Discipline thesis:degree_discipline
- Mathematics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Ford, Daniel
- Contributors dc:contributor
-
- Jeffrey Liese
- Mathematics
- College of Science and Mathematics
Subjects
dc:subject × 7Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.calpoly.edu/theses/3277