Search arXivSearch

arXiv · 2504.19204

Deza graphs and regular polyhedra

Abstract

We classify all regular polyhedra according to their type i.e., the collection of numbers of common neighbours that any pair of distinct vertices may have (polyhedra are planar, $3$-connected graphs). As an application, we recover the classification of planar Deza graphs. Next, we focus on the class of quartic polyhedral Deza graphs, and completely characterise it in terms of medial graphs of certain specific cubic polyhedra. Furthermore, within the aforementioned class of quartic polyhedral Deza graphs, we study the extremal graphs with respect to the ratio of number of triangular faces to the total. In the maximal extreme, these notably coincide with the class of line graphs of cubic polyhedra of girth $5$. We also fully characterise the quartic polyhedra of type $\{0,1,2,3\}$, and in particular we prove that none of them are medial graphs. On one hand our findings fit within the novel research area of common neighbours in graphs. On the other hand, our findings imply general properties of regular planar graphs and regular polyhedra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Riccardo W. Maffucci. 2026-01-22. Deza graphs and regular polyhedra. https://arxiv.org/abs/2504.19204

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO