On the total k-domination number of graphs

DOI10.7151/dmgt.1616zbMath1257.05117OpenAlexW2047922113MaRDI QIDQ4648776

Adel P. Kazemi

Publication date: 16 November 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1616

zbMATH Keywords

\(k\)-tuple domination number\(k\)-tuple total domination number\(k\)-transversal numbertotal \(k\)-domination number

Mathematics Subject Classification ID

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

Related Items (7)

On the total \(k\)-domination in graphs ⋮ Subexponential fixed-parameter algorithms for partial vector domination ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Multiple Domination ⋮ On disjunctive domination in graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs

This page was built for publication: On the total k-domination number of graphs