Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs
From MaRDI portal
Publication:2001989
zbMath1416.05177arXiv1807.10891MaRDI QIDQ2001989
Toshiaki Omori, Hisashi Naito, Tatsuya Tate
Publication date: 11 July 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.10891
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric uniformization and spectral bounds for graphs
- A discrete surface theory
- Spectral partitioning works: planar graphs and finite element meshes
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- The expected eigenvalue distribution of a large regular graph
- Eulerian graphs and related topics. Part 1, Volume 1
- Grotzsh's Heawood coloring theorem
- Geometric coloring theory
- Variations on coloring, surfaces and higher-dimensional manifolds
- Combinatorial structure on triangulations. I: The structure of four colorings
- Combinatorial structures on triangulations. II: Local colorings
- Combinatorial structures on triangulations. III: Coloring with regular polyhedra
- Goldberg-Coxeter construction for 3- and 4-valent plane graphs
- Fourth class of convex equilateral polyhedron with polyhedral symmetry related to fullerenes and viruses
- Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
This page was built for publication: Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs
