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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Minimum-Order Counterexamples to Graffiti.pc Conjecture 256 and Sharp Bounds for Total Domination

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Minimum-Order Counterexamples to Graffiti.pc Conjecture 256 and Sharp Bounds for Total Domination

Tony Newton
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
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
Minimum-Order Counterexamples to Graffiti.pc Conjecture 256 and Sharp Bounds for Total Domination — Tony Newton · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS