Abstract
The degree/diameter problem is to determine the largest graphs of given maximum degree and given diameter. General upper bounds–called Moore bounds–for the order of such graphs are attainable only for certain special graphs, called Moore graphs. Moore graphs are scarce and so the next challenge is to find graphs which are somehow “close” to the nonexistent ideal of a Moore graph by holding fixed two of the parameters, order, diameter and maximum degree, and optimising the third parameter. In this paper we consider the existence of graphs that have order equal to Moore bound for given radius and maximum degree and as the relaxation we require the diameter to be at most one more than the radius. Such graphs are called radial Moore graphs. In this paper we prove that radial Moore graphs exist for every diameter and every sufficiently large degree, depending on the diameter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.