| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Total domination in K₅- and K₆-covered graphs
Abstract : A graph G is Kr-covered if each vertex of G is contained in a Kr-clique. Let $\gamma_t(G)$ denote the total domination number of G. It has been conjectured that every Kr-covered graph of order n with no Kr-component satisfies $\gamma_t(G) \le \frac{2n}{r+1}$. We prove that this conjecture is true for r = 5 and 6.
Cited literature [6 references]
https://hal.inria.fr/hal-00972309
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:07:48 PM
Last modification on : Sunday, June 26, 2022 - 12:01:09 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:31:00 PM
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:07:48 PM
Last modification on : Sunday, June 26, 2022 - 12:01:09 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:31:00 PM
File
486-3129-1-PB.pdf
Files produced by the author(s)