On the Spectrum of the Generalised Petersen Graphs
Adrian Dudek

TL;DR
This paper investigates the spectral properties of generalized Petersen graphs, showing that their eigenvalue gaps diminish as the graph size increases, indicating poor expansion and eigenvalues clustering near the valency.
Contribution
It provides explicit bounds on eigenvalue gaps and demonstrates the asymptotic behavior of eigenvalues in generalized Petersen graphs.
Findings
Eigenvalue gap tends to zero as n increases
Graphs exhibit poor expansion properties for large n
A positive proportion of eigenvalues approach the valency
Abstract
We show that the gap between the two greatest eigenvalues of the generalised Petersen graphs tends to zero as . Moreover, we provide explicit upper bounds on the size of this gap. It follows that these graphs have poor expansion properties for large values of . We also show that a positive proportion of the eigenvalues of tend to the valency.
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 · Limits and Structures in Graph Theory · Finite Group Theory Research
