On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs

zbMath1261.05074MaRDI QIDQ1940998

Lutz Volkmann, Seyyed Mahmoud Sheikholeslami, Hamideh Aram

Publication date: 11 March 2013

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: http://math.usm.my/bulletin/html/vol36_1_4.html

zbMATH Keywords

cylinderminimum weighttotal \(\{k\}\)-domatic numbertotal \(\{k\}\)-dominating functiontotal \(\{k\}\)-domination numberNordhaus-Gaddum type resultpoduct of cycle and path

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Total \(\{k\}\)-domination in special graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs ⋮ Complexity of Total {k}-Domination and Related Problems ⋮ Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees ⋮ Upper bounds on the signed \((k,k)\)-domatic number of digraphs ⋮ Trees with 2-reinforcement number three

This page was built for publication: On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs