The cover-to-domination cover pebbling ratio conjecture
Let be a graph with more than one vertex. Write for its cover pebbling number and for its domination cover pebbling number. Cover-to-domination cover pebbling ratio conjecture. The ratio should satisfy
The paper notes that this bound is attained by the complete graph on two vertices and that graph families can make the ratio arbitrarily close to from above; whether the bound holds for every graph remains open.
References
2 papers in this index state this conjecture (2004–2005). The statement above is taken from the most recent of them; the others are arXiv:math/0410030.
Source: Nathaniel G. Watson and Carl R. Yerger, “Domination Cover Pebbling: Structural Results”, arXiv:math/0509564 (2005).
Progress summary
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.