An inequality related to Vizing's conjecture
The electronic journal of combinatorics, Tome 7 (2000)
Let $\gamma(G)$ denote the domination number of a graph $G$ and let $G\square H$ denote the Cartesian product of graphs $G$ and $H$. We prove that $\gamma(G)\gamma(H) \le 2 \gamma(G\square H)$ for all simple graphs $G$ and $H$.
DOI :
10.37236/1542
Classification :
05C69, 05C35
Mots-clés : Vizing's conjecture, domination number
Mots-clés : Vizing's conjecture, domination number
@article{10_37236_1542,
author = {W. Edwin Clark and Stephen Suen},
title = {An inequality related to {Vizing's} conjecture},
journal = {The electronic journal of combinatorics},
year = {2000},
volume = {7},
doi = {10.37236/1542},
zbl = {0947.05056},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1542/}
}
W. Edwin Clark; Stephen Suen. An inequality related to Vizing's conjecture. The electronic journal of combinatorics, Tome 7 (2000). doi: 10.37236/1542
Cité par Sources :