Skip to Main content Skip to Navigation
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-00972309
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, April 3, 2014 - 4:07:48 PM
Last modification on : Thursday, June 17, 2021 - 3:50:07 AM
Long-term archiving on: : Thursday, July 3, 2014 - 4:31:00 PM

File

486-3129-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00972309, version 1

Collections

Citation

Odile Favaron, H. Karami, S. M. Sheikholeslami. Total domination in K₅- and K₆-covered graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.35--42. ⟨hal-00972309⟩

Share

Metrics

Record views

248

Files downloads

1076