%0 Journal Article
%T Total domination in K 5- and K 6-covered graphs
%A Odile Favaron
%A Hosein Karami
%A Seyed Mahmoud Sheikholeslami
%J Discrete Mathematics & Theoretical Computer Science
%D 2008
%I Discrete Mathematics & Theoretical Computer Science
%X A graph G is K r-covered if each vertex of G is contained in a K r-clique. Let ¦Ã t (G) denote the total domination number of G. It has been conjectured that every K r-covered graph of order n with no K r-component satisfies ¦Ã t (G) ¡Ü 2n/(r+1). We prove that this conjecture is true for r=5 and 6.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/486