10.46298/dmtcs.433
https://dmtcs.episciences.org/433
Favaron, Odile
Odile
Favaron
Karami, H.
H.
Karami
Sheikholeslami, S. M.
S. M.
Sheikholeslami
Total domination in K₅- and K₆-covered graphs
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.
episciences.org
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2008-01-01
2008-01-01
en
journal article
https://hal.science/hal-00972309v1
1365-8050
https://dmtcs.episciences.org/433/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 10 no. 1
Graph and Algorithms
Researchers
Students