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
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
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