scientific article; zbMATH DE number 146666

MaRDI QIDQ4029974zbMATH OpenFDO

Authors Michael A. Henning, Ortrud R. Oellermann, H. C. Swart

Publication date 1 April 1993

zbMATH Keywords

boundsdistance dominationdominating setNordhaus-Gaddum type bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 716402
• An algorithm to find two distance domination parameters in a graph
• scientific article; zbMATH DE number 617203
• scientific article; zbMATH DE number 19197
• scientific article; zbMATH DE number 798658

Cited in

(36)

• The diversity of domination
• On connected k-domination numbers of graphs.
• Packing in trees
• An algorithm to find two distance domination parameters in a graph
• On bondage numbers of graphs: a survey with some comments
• Distributed distance domination in graphs with no \(K_{2,t}\)-minor
• Some new results on distance \(k\)-domination in graphs
• Mim-width. III. Graph powers and generalized distance domination problems
• Distance domination in graphs with given minimum and maximum degree
• Strong non split \(r\)-domination number of a graph
• Bounds for distance domination numbers of graphs
• Distance domination in graphs
• On the Universality of Small-World Graphs
• The ratio of the distance irredundance and domination numbers of a graph
• scientific article; zbMATH DE number 617203 (Why is no real title available?)
• scientific article; zbMATH DE number 716402 (Why is no real title available?)
• scientific article; zbMATH DE number 1014819 (Why is no real title available?)
• Distance domination versus iterated domination
• scientific article; zbMATH DE number 798658 (Why is no real title available?)
• scientific article; zbMATH DE number 841619 (Why is no real title available?)
• scientific article; zbMATH DE number 861404 (Why is no real title available?)
• scientific article; zbMATH DE number 861435 (Why is no real title available?)
• Generalized distance domination problems and their complexity on graphs of bounded mim-width
• An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
• Total \(k\)-distance domination critical graphs
• Approximating the Spanning k-Tree Forest Problem
• Lower bound on the distance k-domination number of a tree
• Bounds for the minimum distance function
• An efficient algorithm for distance total domination in block graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• The d-distance p-packing domination number: complexity, cycles, and trees
• (t, r)-broadcast domination in graphs
• Upper distance-two domination
• Some variations of perfect graphs
• Distance irredundance and connected domination numbers of a graph
• A linear time algorithm for optimal \(k\)-hop dominating set of a tree

This page was built for publication:

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