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

DOI10.1007/BF03323033zbMATH Open1081.05087MaRDI QIDQ2581114FDOQ2581114

Authors: Dirk Meierling, Lutz Volkmann 

Publication date: 13 January 2006

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bound on the domination number of a tree
• Relations between packing and covering numbers of a tree
• On packing and covering numbers of graphs
• Lower bound on the distance \(k\)-domination number of a tree

Cited In (10)

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

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)