Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.08547

Coronoids, Patches and Generalised Altans

Nino Bašić·Patrick W. Fowler·Tomaž Pisanski
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we revisit coronoids, in particular multiple coronoids. We consider a mathematical formalisation of the theory of coronoid hydrocarbons that is solely based on incidence between hexagons of the infinite hexagonal grid in the plane. In parallel, we consider perforated patches, which generalise coronoids: in addition to hexagons, other polygons may also be present. Just as coronoids may be considered as benzenoids with holes, perforated patches are patches with holes. Both cases, coronoids and perforated patches, admit a generalisation of the altan operation that can be performed at several holes simultaneously. A formula for the number of Kekulé structures of a generalised altan can be derived easily if the number of Kekulé structures is known for the original graph. Pauling Bond Orders for generalised altans are also easy to derive from those of the original graph.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nino Bašić, Patrick W. Fowler, Tomaž Pisanski. 2015-09-29. Coronoids, Patches and Generalised Altans. https://doi.org/10.1007/s10910-016-0599-6

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↗