The independent domination number of a random graph.

Lane H. Clark Darin Johnson

Published in: Discuss. Math. Graph Theory (2011)

Keyphrases

random graphs
computational complexity
network topology
np hard
upper bound
level set
graph theoretic