Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1511.00590

Maximal matchings in polyspiro and benzenoid chains

Tomislav Došlić·Taylor Short
View original source ↗Read source document ↗Export metadata ↓

Abstract

A matching $M$ of a graph $G$ is maximal if it is not a proper subset of any other matching in $G$. Maximal matchings are much less known and researched than their maximum and perfect counterparts. In particular, almost nothing is known about their enumerative properties. In this paper we present the recurrences and generating functions for the sequences enumerating maximal matchings in two classes of chemically interesting linear polymers: polyspiro chains and benzenoid chains. We also analyze the asymptotic behavior of those sequences and determine the extremal cases.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomislav Došlić, Taylor Short. 2015-11-02. Maximal matchings in polyspiro and benzenoid chains. https://arxiv.org/abs/1511.00590

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗