scientific article; zbMATH DE number 146666
From MaRDI portal
Publication:4029974
zbMATH Open0766.05040MaRDI QIDQ4029974FDOQ4029974
Authors: Michael A. Henning, Ortrud R. Oellermann, H. C. Swart
Publication date: 1 April 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (30)
- On the Universality of Small-World Graphs
- Mim-width. III. Graph powers and generalized distance domination problems
- Title not available (Why is that?)
- Generalized distance domination problems and their complexity on graphs of bounded mim-width
- Title not available (Why is that?)
- Approximating the Spanning k-Tree Forest Problem
- \(k\)-domination and \(k\)-independence in graphs: A survey
- The diversity of domination
- On connected \(k\)-domination numbers of graphs.
- Title not available (Why is that?)
- Distance irredundance and connected domination numbers of a graph
- Some variations of perfect graphs
- Some new results on distance \(k\)-domination in graphs
- Distance domination versus iterated domination
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor
- An algorithm to find two distance domination parameters in a graph
- Total \(k\)-distance domination critical graphs
- On bondage numbers of graphs: a survey with some comments
- Title not available (Why is that?)
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- An efficient algorithm for distance total domination in block graphs
- Lower bound on the distance \(k\)-domination number of a tree
- Bounds for distance domination numbers of graphs
- Bounds for the minimum distance function
- Distance domination in graphs
- Distance domination in graphs with given minimum and maximum degree
- Strong non split \(r\)-domination number of a graph
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- Packing in trees
- The ratio of the distance irredundance and domination numbers of a graph
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)