Independence andk-domination in graphs

DOI10.1080/00207160.2010.482664zbMath1210.05096OpenAlexW2057788370MaRDI QIDQ2995488

Dirk Meierling, Adriana Hansberg, Lutz Volkmann

Publication date: 21 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2010.482664

zbMATH Keywords

maximum independent setk-domination

Mathematics Subject Classification ID

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

Related Items (10)

A note on the annihilation number and 2-domination number of a tree ⋮ The annihilation number does not bound the 2-domination number from the above ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ Trees with maximum \(p\)-reinforcement number ⋮ Domination number, independent domination number and 2-independence number in trees ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ Multiple Domination ⋮ Trees with 2-reinforcement number three

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the k-domination number of a graph
• Some bounds on the \(p\)-domination number in trees
• Onk-domination and minimum degree in graphs
• An upper bound for thek-domination number of a graph

This page was built for publication: Independence andk-domination in graphs