Bounds on the connected \(k\)-domination number in graphs

DOI10.1016/j.dam.2010.05.021zbMath1215.05124OpenAlexW2050150370MaRDI QIDQ608255

Adriana Hansberg

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.021

zbMATH Keywords

connected \(k\)-domination\(k\)-dominationconnected total \(k\)-dominationtotal \(k\)-domination

Mathematics Subject Classification ID

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

Related Items (7)

\(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Exponential domination in subcubic graphs ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Bounds on the exponential domination number ⋮ Connected Domination ⋮ Multiple Domination ⋮ ANOTHER LOOK AT k-DOMINATION IN GRAPHS

Cites Work

• Dominating a Family of Graphs with Small Connected Subgraphs
• A general method in the theory of domination in graphs
• On Hadwiger's Number and the Stability Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the connected \(k\)-domination number in graphs