Weighted Graham-type conjecture for cover pebbling numbers
Statement
Let and be graphs. A nonnegative function on a graph assigns a nonnegative real number to each vertex. Let be a nonnegative function on and a nonnegative function on , and define on the Cartesian product by
The weighted cover pebbling number is the minimum number of pebbles sufficient to meet the vertex demands specified by , regardless of the initial distribution. Weighted Graham-type conjecture. The weighted cover pebbling number satisfies
This is proposed as a conjecture analogous to Graham's conjecture. The paper presents it after stating related open problems, and no resolution is supplied.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.