UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Distance-Biregular Graphs and Orthogonal Polynomials

Thumbnail Image

Files

Lato_Sabrina.pdf (756.37 KB)

Date

2023-09-15

Authors

Lato, Sabrina

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis is about distance-biregular graphs– when they exist, what algebraic and structural properties they have, and how they arise in extremal problems. We develop a set of necessary conditions for a distance-biregular graph to exist. Using these conditions and a computer, we develop tables of possible parameter sets for distancebiregular graphs. We extend results of Fiol, Garriga, and Yebra characterizing distance-regular graphs to characterizations of distance-biregular graphs, and highlight some new results using these characterizations. We also extend the spectral Moore bounds of Cioaba et al. to semiregular bipartite graphs, and show that distance-biregular graphs arise as extremal examples of graphs meeting the spectral Moore bound.

Description

Keywords

distance-biregular graphs, orthogonal polynomials, spectral Moore bounds, spectral excess, feasible, coherent configuration

LC Keywords

Citation

URI

http://hdl.handle.net/10012/19866

Collections

Theses
Combinatorics and Optimization