Events by date

Title: A Spectral Moore Bound for Bipartite Semiregular Graphs

Speaker: Sabrina Lato Affiliation: University of Waterloo Zoom: Contact Soffia Arnadottir

Abstract:

The Moore bound provides an upper bound on the number of vertices of a regular graph with a given degree and diameter, though there are disappointingly few graphs that achieve this bound. Thus, it is interesting to ask what additional information can be used to give Moore-type bounds that are tight for a larger number of graphs. Cioaba, Koolen, Nozaki, and Vermette considered regular graphs with a given second-largest eigenvalue, and found an upper bound for such graphs.