9 problems
Let be the complete bipartite graph with part sizes and , and let denote its power domination reconfiguration graph under token addit…
Degree-bounded expected value polynomial conjecture. The polynomial has degree at most if and only if, for every ,
Let and be integers, and let be a connected claw-free -regular graph of order . Let denote the minimum cardinality of a -powe…
Let be a connected -regular graph of order , with , and let . Write for the minimum cardinality of a -power dominating set of . As…
Let be a graph of order , and let denote its complement. Assume that every component of both and has order at least . Write…
Let be a graph. Write for the minimum fort size of , let denote the marginal observance at step , and let denote the…
Let be any graph, and let denote its middle graph. Write for the power domination number of and for the edge domination number of…
Let be a connected -uniform hypergraph on vertices, and let denote its -power domination number. Assume . Chang–Roussel…
Quarter-order bound.