We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
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
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.