A note on Haynes-Hedetniemi-Slater Conjecture

We notice that Haynes-Hedetniemi-Slater Conjecture is true (i.e. $γ(G) \leq \fracδ{3δ-1}n$ for every graph $G$ of size $n$ with minimum degree $δ\geq 4$, where $γ(G)$ is the domination number of $G$). Because the conjecture for $δ=6$ follows from the estimate n (1 - \prod_{i= 1}^[δ+ 1} (δi)/(δi + 1) by W. E. Clark, B. Shekhtman, S. Suen [Upper bounds of the Domination Number of a Graph, Congressus Numerantium, 132 (1998), pp. 99-123.]

No reviews yet.

No comments yet.