The non-existence of some Moore polygons and spectral Moore bounds
Sebastian M. Cioab\u{a}, Vishal Gupta, Hiroshi Nozaki, Ziqing Xiang

TL;DR
This paper investigates the existence and bounds of Moore polygons in regular graphs, providing new nonexistence results, exact values for specific parameters, and insights into the second eigenvalue constraints of such graphs.
Contribution
It proves new nonexistence results for Moore polygons with certain parameters and determines new exact values of the maximum order for specific regular graphs.
Findings
Proved nonexistence of Moore polygons with certain parameters.
Determined that v(4, √2) = 14 and v(5, √2) = v(5, √5 - 1) = 16.
Established bounds on the second eigenvalue for 5-regular graphs, identifying the unique extremal graph.
Abstract
In this paper, we study the maximum order of a connected -regular graph whose second largest eigenvalue is at most . From Alon-Boppana and Serre, we know that is finite when while the work of Marcus, Spielman, and Srivastava implies that is infinite if . Cioab\u{a}, Koolen, Nozaki, and Vermette obtained a general upper bound on via Nozaki's linear programming bound and determined many values of . The graphs attaining this bound are distance-regular and are called Moore polygons. Damerell and Georgiacodis proved that there are no Moore polygons of diameter or more. For smaller diameters, there are infinitely many Moore polygons. We complement these results by proving two nonexistence results for Moore polygons with specific parameters. We also determine…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · graph theory and CDMA systems
