The Truncated Octahedral Graph Has Bondage Number Five
Prateek R. Srivastava
Source abstract
For a graph G, its bondage number b(G) is the minimum number of edges whose deletion increases its domination number. Dunbar, Haynes, Teschner, and Volkmann conjectured in 1998 that every nontrivial planar graph satisfies b(G) 4 = Delta(T) + 1 and disproves the conjecture. The finite parts of the verification are exhaustive: the direct verifier checks candidate dominating sets of sizes six, seven, and eight and all 58,905 four-edge sets. The targeted discovery search and an independently written verifier are described, and the complete C++20 verifier is included in the source archive.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.