The domination–isolation ratio conjecture for cubic graphs
The domination–isolation ratio conjecture for cubic graphs
From papers
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Geoffrey Boyer, Wayne Goddard and Michael A. Henning, “On the Relationships between Domination, Isolation, and Packing”, arXiv:2606.18172 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.