Equality in a bound that relates the size and the restrained domination number of a graph.

Johannes H. Hattingh Ernst J. Joubert

Published in: J. Comb. Optim. (2016)

Keyphrases

small number
memory requirements
maximum number
computational complexity
upper bound
database
constant factor
pairwise
worst case
random walk
graph model
fixed number
space requirements
network size
grow exponentially