Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.25410

On the Genus Polynomial of Cubic Graphs

Austin Ulrigg
View original source ↗Read source document ↗Export metadata ↓

Abstract

The orientable genus polynomial of a graph counts its cellular embeddings by genus. For finite simple $2$-connected cubic graphs it is a cycle-matroid invariant: $M(G)\cong M(H)$ implies $Γ_G=Γ_H$. The adjacency spectrum and the genus polynomial are incomparable: neither determines the other. We exhibit connected cubic graphs on $16$ vertices sharing the adjacency spectrum, spanning-tree count, girth, diameter, vertex and edge connectivity, automorphism-group order, and cycle counts through length $10$, yet with pairwise distinct genus polynomials. Splitting the expected face count at twice the girth explains the difference: short faces are spectral, long faces are not. We construct an explicit infinite family of connected cospectral cubic pairs $(G_t,H_t)$ on $14+2t$ vertices whose minimum genera differ. We also compute the genus polynomials of all $7,875,918$ connected cubic graphs through $22$ vertices and derive from short-cycle counts a deterministic lower bound on the minimum genus.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Austin Ulrigg. 2026-07-28. On the Genus Polynomial of Cubic Graphs. https://arxiv.org/abs/2607.25410

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗