Changing and unchanging of the domination number of a graph.

Vladimir Samodivkin

Published in: Discret. Math. (2008)

Keyphrases

computational complexity
np hard
case study
maximum number
graph theoretic
databases
lower bound
graph theory
graph structure
undirected graph