Abstract
A Moore ( d, k)-graph is a regular graph of degree d with diameter k and girth 2 k + 1. It is proved that every edge of a Moore ( d, k)-graph is contained in the same number r m cycles of length m, where m ⩽ 4 k + 1. A recurrence relation for r m is given. Further, some corollaries, as for the impossibility of certain Moore graphs, are shown, e.g., if 3 ⩽ d ⩽ 100 and 3 ⩽ k ⩽ 100, then there is no Moore ( d, k)-graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
