Report copyright - The Algorithmic Complexity of Signed Domination …The domination number and upper domination number of a graph G can be defined as 1'( G) = min { I a dominating function on and {
Please pass captcha verification before submit form
Please pass captcha verification before submit form