Abstract

We are concerned with spectral problems of the Goldberg-Coxeter construction for $3$- and $4$-valent finite graphs. The Goldberg-Coxeter constructions $\mathrm{GC}_{k,l}(X)$ of a finite $3$- or $4$-valent graph $X$ are considered as ``subdivisions'' of $X$, whose number of vertices are increasing at order $O(k^2+l^2)$, nevertheless which have bounded girth. It is shown that the first (resp. the last) $o(k^2)$ eigenvalues of the combinatorial Laplacian on $\mathrm{GC}_{k,0}(X)$ tend to $0$ (resp. tend to $6$ or $8$ in the $3$- or $4$-valent case, respectively) as $k$ goes to infinity. A concrete estimate for the first several eigenvalues of $\mathrm{GC}_{k,l}(X)$ by those of $X$ is also obtained for general $k$ and $l$. It is also shown that the specific values always appear as eigenvalues of $\mathrm{GC}_{2k,0}(X)$ with large multiplicities almost independently to the structure of the initial $X$. In contrast, some dependency of the graph structure of $X$ on the multiplicity of the specific values is also studied.

Highlights

  • The Goldberg-Coxeter construction is a subdivision of a 3- or 4-valent graph, and it is defined by Dutour-Deza [5] for a plane graph based on a simplicial subdivision of regular the electronic journal of combinatorics 26(3) (2019), #P3.7 polytopes in [1, 15]

  • GoldbergCoxeter constructions of regular polyhedra generate a class of Archimedean polyhedra, and infinite sequence of polyhedra, which are called Goldberg polyhedra

  • Let X = (V (X), E(X)) be a connected, finite and simple 3- or 4-valent graph equipped with an orientation at each vertex, and GCk,0(X) be the Goldberg-Coxeter construction of X for k 1

Read more

Summary

Introduction

The Goldberg-Coxeter construction is a subdivision of a 3- or 4-valent graph, and it is defined by Dutour-Deza [5] for a plane graph based on a simplicial subdivision of regular the electronic journal of combinatorics 26(3) (2019), #P3.7 polytopes in [1, 15]. Let X be a connected, finite and simple 4-valent graph equipped with an orientation at each vertex, and GC2k,0(X) be its Goldberg-Coxeter constructions for k ∈ N. The girths of the GoldbergCoxeter constructions {GCk,l(X)}k,l with an initial graph X are uniformly bounded with respect to the parameters k and l, and it would not be so straightforward to apply a trace formula to obtain a limit distribution of the eigenvalue distributions. At the end of this paper, we shall give a few criteria for a 3-valent plane graph X so that some GCk,0(X)’s have eigenvalues 2 or 4, which proves Theorem 1.6

Goldberg-Coxeter constructions
The case where X is 3-valent
The case where X is 4-valent
Specific conditions on 3-valent plane graphs
Two comparisons of the eigenvalues
On the eigenvalues 2 and 4 for Goldberg-Coxeter constructions

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 call

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.