The domination–isolation ratio conjecture for cubic graphs
Let be a cubic graph, with domination number and isolation number . Domination–isolation ratio conjecture. For every cubic graph ,
The conjecture would improve the general ratio bound discussed in the source, which is at most for cubic graphs; no resolution is given, so the question remains open.
References
Primary source
Geoffrey Boyer, Wayne Goddard and Michael A. Henning, “On the Relationships between Domination, Isolation, and Packing”, arXiv:2606.18172 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.