The quarter-order bound for power domination in connected hypergraphs
The quarter-order bound for power domination in connected hypergraphs
Let be a connected hypergraph on at least four vertices, with every edge satisfying . Write for its power domination number and for its infectious power domination number.
Quarter-order bound.
The conjecture proposes that the observation or infection step improves the general domination bound from to for connected hypergraphs whose edges all have size at least three. Its status is not resolved in the supplied source context.
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
Beth Bjorkman, “Infectious power domination of hypergraphs”, arXiv:1910.03038 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.