Minimum-Order Counterexamples to Graffiti.pc Conjecture 256 and Sharp Bounds for Total Domination
Graffiti.pc Conjecture 256 proposes a lower bound on total domination in terms of theneighbourhood of the minimum-degree vertices and the largest edge neighbourhood. Weconstruct a counterexample of order 14 and prove that no smaller connected simple graphviolates the bound. Explicit families determine the sharp replacement coefficient bothuniversally and at fixed total domination number.
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.24427698
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint