6 problems
Matching
Every finite cubic graph has four total dominating sets such that, for every and every vertex ,…
For every integer , determine whether the domination number of the -token graph of the path graph satisfies , where…
For every finite simple graph , if its ordinary domination number equals its eternal domination number, then it equals its upper domination number:…
Given a finite graph with no isolated vertices and domination number , determine exactly which graphs satisfy ; equivalently, characterize all finit…
For every nontrivial planar graph , the bondage number satisfies , where and…
Let be any graph, and let denote its middle graph. Write for the power domination number of and for the edge domination number of…