eng
episciences.org
Discrete Mathematics & Theoretical Computer Science
1365-8050
2008-01-01
Vol. 10 no. 1
Graph and Algorithms
10.46298/dmtcs.433
433
journal article
Total domination in K₅- and K₆-covered graphs
Odile Favaron
H. Karami
S. M. Sheikholeslami
Graphs and Algorithms
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 satisﬁes $\gamma_t(G) \le \frac{2n}{r+1}$. We prove that this conjecture is true for r = 5 and 6.
https://dmtcs.episciences.org/433/pdf
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]