Login / Signup
Lower bounds on the signed k-domination number of graphs.
Lutz Volkmann
Published in:
Ars Comb. (2017)
Keyphrases
</>
lower bound
computational complexity
small number
upper bound
objective function
pairwise
knn
graph theory
finite number