Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2010.03895

Zhang-Zhang Polynomials of Ribbons

Bing-Hau He·Chien-Pin Chou·Johanna Langner·Henryk A. Witek
View original source ↗Read source document ↗Export metadata ↓

Abstract

We report a closed-form formula for the Zhang-Zhang polynomial (aka ZZ polynomial or Clar covering polynomial) of an important class of elementary pericondensed benzenoids $Rb\left(n_{1},n_{2},m_{1},m_{2}\right)$ usually referred to as ribbons. A straightforward derivation is based on the recently developed interface theory of benzenoids [Langner and Witek, MATCH Commun. Math. Comput. Chem. 84, 143--176 (2020)]. The discovered formula provides compact expressions for various topological invariants of $Rb\left(n_{1},n_{2},m_{1},m_{2}\right)$: the number of Kekulé structures, the number of Clar covers, its Clar number, and the number of Clar structures. The last two classes of elementary benzenoids, for which closed-form ZZ polynomial formulas remain to be found, are hexagonal flakes $O\left(k,m,n\right)$ and oblate rectangles $Or\left(m,n\right)$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bing-Hau He, Chien-Pin Chou, Johanna Langner, Henryk A. Witek. 2020-10-08. Zhang-Zhang Polynomials of Ribbons. https://arxiv.org/abs/2010.03895

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↗