Login / Signup
On the upper total domination number of Cartesian products of graphs.
Paul Dorbec
Michael A. Henning
Douglas F. Rall
Published in:
J. Comb. Optim. (2008)
Keyphrases
</>
small number
computational complexity
graph matching
graph model
graph theory
graph theoretic
edge weights
random graphs