| | |
| | |
Stat |
Members: 3645 Articles: 2'500'096 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
A note on Haynes-Hedetniemi-Slater Conjecture | Tomoo Yokoyama
; | Date: |
15 Nov 2010 | Abstract: | We notice that Haynes-Hedetniemi-Slater Conjecture is true (i.e. $gamma(G)
leq frac{delta}{3delta -1}n$ for every graph $G$ of size $n$ with minimum
degree $delta geq 4$, where $gamma(G)$ is the domination number of $G$).
Because the conjecture for $delta =6$ follows from the estimate n (1 -
prod_{i= 1}^[delta + 1} (delta i)/(delta 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.] | Source: | arXiv, 1011.3383 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |