Nordhaus-Gaddum Type Results for Total Domination - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2011

Nordhaus-Gaddum Type Results for Total Domination

Résumé

A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper we study Nordhaus-Gaddum-type results for total domination. We examine the sum and product of γt(G1) and γt(G2) where G1 ⊕G2 = K(s,s), and γt is the total domination number. We show that the maximum value of the sum of the total domination numbers of G1 and G2 is 2s+4, with equality if and only if G1 = sK2 or G2 = sK2, while the maximum value of the product of the total domination numbers of G1 and G2 is max{8s,⌊(s+6)2/4 ⌋}.
Fichier principal
Vignette du fichier
1830-6703-1-PB.pdf (141.25 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00993071 , version 1 (19-05-2014)

Identifiants

Citer

Michael Antony Henning, Ernst Joubert, Justin Southey. Nordhaus-Gaddum Type Results for Total Domination. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 3 (3), pp.87-96. ⟨10.46298/dmtcs.530⟩. ⟨hal-00993071⟩

Collections

TDS-MACS
93 Consultations
1184 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More