Domination Inequalities for Benzenoid Graphs: A Boundary Identity and an Exact Finite Theorem

We establish six proposed domination-number bounds for every benzenoid withat most nine hexagonal faces. In particular, writing m(B) and h(B) for the numbers of edgesand hexagons, respectively, we verify γ(B) ≤ m(B)/2 − h(B) throughout this range. The proofcombines an exhaustive enumeration of all 8,386 free simply connected polyhexes with explicitdominating-set certificates checked by an independent integer-arithmetic verifier. We alsoprove the unrestricted boundary identity e22(B) − eext33 (B) = 6, which reduces the six boundsto three structural parameters. The finite verification does not establish the conjectures forarbitrary benzenoids.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24409413
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Domination Inequalities for Benzenoid Graphs: A Boundary Identity and an Exact Finite Theorem

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Domination Inequalities for Benzenoid Graphs: A Boundary Identity and an Exact Finite Theorem

Tony Newton
preprint en

Abstract

We establish six proposed domination-number bounds for every benzenoid withat most nine hexagonal faces. In particular, writing m(B) and h(B) for the numbers of edgesand hexagons, respectively, we verify γ(B) ≤ m(B)/2 − h(B) throughout this range. The proofcombines an exhaustive enumeration of all 8,386 free simply connected polyhexes with explicitdominating-set certificates checked by an independent integer-arithmetic verifier. We alsoprove the unrestricted boundary identity e22(B) − eext33 (B) = 6, which reduces the six boundsto three structural parameters. The finite verification does not establish the conjectures forarbitrary benzenoids.

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon