Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum possible order of a graph. The Moore bound represents the upper threshold that such an order may achieve, and only few graphs reach this threshold. In this thesis, we explore these graphs, including the elusive, hypothetical Moore graph of degree 57. This thesis will also examine graphs that fail to achieve equality in the Moore bound by only a few vertices. These graphs also turn out to be scarce. Finally, we look at a related problem, the Moore bipartite bound, and examine graphs that come very close to achieving this upper bound.
|Commitee:||Lazebnik, Felix, Ghandehari, Mahya|
|School:||University of Delaware|
|School Location:||United States -- Delaware|
|Source:||MAI 82/3(E), Masters Abstracts International|
|Subjects:||Mathematics, Theoretical Mathematics|
|Keywords:||Algebraic graph theory, Degree/diameter problem, Graph theory, Moore graphs, Spectral graph theory|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be