Login / Signup
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree.
Johannes H. Hattingh
Ernst J. Joubert
Published in:
Discret. Appl. Math. (2009)
Keyphrases
</>
constant factor
upper bound
maximum distance
random graphs
lower bound
small number
computational complexity
worst case
largest number
minimum cost
minimum total cost
square error
polynomial time complexity
degree distribution
spanning tree
data sets
random walk
information retrieval
neural network