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

DOI10.1007/BF03323033MaRDI QIDQ2581114zbMATH OpenFDO

Authors 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)

Recommendations

• Lower bound on the distance \(k\)-domination number of a tree
• Distance domination and distance irredundance in graphs
• scientific article; zbMATH DE number 1123784
• The minimum eccentric distance sum of trees with given distance \(k\)-domination number
• Distance-\(k\) locating-dominating sets in graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Lower bound on the distance \(k\)-domination number of a tree
• Lower bound on the domination number of a tree
• On packing and covering numbers of graphs
• Relations between packing and covering numbers of a tree

Cited in

(10)

• Distance domination in graphs with given minimum and maximum degree
• scientific article; zbMATH DE number 5174847 (Why is no real title available?)
• Lower bound on the distance \(k\)-domination number of a tree
• A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
• Distance domination in vertex partitioned graphs
• Domination on hyperbolic graphs
• \(m\)-dominating \(k\)-ended trees of graphs
• A note on neighborhood total domination in graphs
• Distance domination in graphs
• Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581114)