A lower bound for the distance \(k\)-domination number of trees

DOI10.1007/BF03323033zbMath1081.05087MaRDI QIDQ2581114

Dirk Meierling, Lutz Volkmann

Publication date: 13 January 2006

Published in: Results in Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph ⋮ Distance domination in graphs with given minimum and maximum degree ⋮ Domination on hyperbolic graphs ⋮ Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs ⋮ A note on neighborhood total domination in graphs ⋮ Distance Domination in Graphs

Cites Work

• On packing and covering numbers of graphs
• Relations between packing and covering numbers of a tree
• Lower bound on the domination number of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound for the distance \(k\)-domination number of trees