2 papers
math.CO2026
The Truncated Octahedral Graph Has Bondage Number Five
Prateek R. Srivastava
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 tha…
math.CO2026
A Ten-Vertex Counterexample to a Conjecture on Unstable Graphs
Prateek R. Srivastava
Mizzi conjectured that every nontrivially unstable graph contains cycles C_k and C_{2k} for some odd k. We give a connected, nonbipartite, vertex-determining counterexample on ten…