Total domination in K₅- and K₆-covered graphs
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽
Graphs and Algorithms International audience 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.
2011 ◽
Vol Vol. 13 no. 3
(Graph Theory)
◽
Keyword(s):
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
2019 ◽
Vol 11
(01)
◽
pp. 1950004
2018 ◽
Vol 244
◽
pp. 103-115
◽
2019 ◽
Vol 13
(07)
◽
pp. 2050129
2017 ◽
Vol 9
(5/6)
◽
pp. 541
2007 ◽
Vol 307
(7-8)
◽
pp. 1016-1020
◽