1 research outputs found
On Rall's -conjecture on the domination game
The -conjecture on the domination game asserts that if is a
traceable graph, then the game domination number of is at
most . A traceable graph is a
-graph if holds.
It is proved that the so-called hatted cycles are -graphs and that
unicyclic graphs fulfill the -conjecture. Several additional families of
graphs that support the conjecture are determined and computer experiments
related to the conjecture described