Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for $3$- and $4$-valent graphs
Toshiaki Omori, Hisashi Naito, Tatsuya Tate

TL;DR
This paper investigates the spectral properties of Goldberg-Coxeter constructions on 3- and 4-valent graphs, revealing how eigenvalues behave as the subdivision parameters grow, with implications for graph structure and eigenvalue multiplicities.
Contribution
It provides new asymptotic results for eigenvalues of Laplacians on Goldberg-Coxeter graphs and estimates relating these eigenvalues to the original graph's spectrum.
Findings
First eigenvalues tend to zero as subdivision increases.
Largest eigenvalues tend to 6 or 8 depending on valency.
Certain eigenvalues appear with high multiplicity regardless of initial graph structure.
Abstract
We are concerned with spectral problems of the Goldberg-Coxeter construction for - and -valent finite graphs. The Goldberg-Coxeter constructions of a finite - or -valent graph are considered as "subdivisions" of , whose number of vertices are increasing at order , nevertheless which have bounded girth. It is shown that the first (resp. the last) eigenvalues of the combinatorial Laplacian on tend to (resp. tend to or in the - or -valent case, respectively) as goes to infinity. A concrete estimate for the first several eigenvalues of by those of is also obtained for general and . It is also shown that the specific values always appear as eigenvalues of with large multiplicities almost independently to the structure of the…
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 · Spectral Theory in Mathematical Physics · Synthesis and Properties of Aromatic Compounds
