Back to search

University of Waterloo

Graph Coverings with Few Eigenvalues or No Short Cycles

Abstract

dc:description.abstract

This thesis addresses the extent of the covering graph construction. How much must a cover X resemble the graph Y that it covers? How much can X deviate from Y? The main statistics of X and Y which we will measure are their regularity, the spectra of their adjacency matrices, and the length of their shortest cycles. These statistics are highly interdependent and the main contribution of this thesis is to advance our understanding of this interdependence. We will see theorems that characterize the regularity of certain covering graphs in terms of the number of distinct eigenvalues of their adjacency matrices. We will see old examples of covers whose lack of short cycles is equivalent to the concentration of their spectra on few points, and new examples that indicate certain limits to this equivalence in a more general setting. We will see connections to many combinatorial objects such as regular maps, symmetric and divisible designs, equiangular lines, distance-regular graphs, perfect codes, and more. Our main tools will come from algebraic graph theory and representation theory. Additional motivation will come from topological graph theory, finite geometry, and algebraic topology.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Levit, Maxwell
Advisor dc:contributor.advisor
  • Chris, Godsil

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/19459

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Levit, Maxwell. Graph Coverings with Few Eigenvalues or No Short Cycles. University of Waterloo, 2023. http://hdl.handle.net/10012/19459