Connected domination of regular graphs
From MaRDI portal
Recommendations
Cites work
- A short note on the approximability of the maximum leaves spanning tree problem
- Analysis of greedy algorithms on graphs with bounded degrees
- Approximating the minimum maximal independence number
- Approximation algorithms for combinatorial problems
- Approximation algorithms for connected dominating sets
- Connected Domination and Spanning Trees with Many Leaves
- Constructing full spanning trees for cubic graphs
- Differential equations for random processes and random graphs
- Dominating sets whose closed stars form spanning trees
- scientific article; zbMATH DE number 5158519 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305098 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 1015397 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1947432 (Why is no real title available?)
- scientific article; zbMATH DE number 2079403 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 1875441 (Why is no real title available?)
- scientific article; zbMATH DE number 1405894 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- Minimum connected dominating sets of random cubic graphs
- Minimum independent dominating sets of random cubic graphs
- On the Independent Domination Number of Random Regular Graphs
- On the ratio of optimal integral and fractional covers
- On weakly connected domination in graphs
- Optimization, approximation, and complexity classes
- Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
- Spanning trees in graphs of minimum degree 4 or 5
- Spanning trees with many leaves in cubic graphs
- The dominating number of a random cubic graph
- Transversal numbers of uniform hypergraphs
Cited in
(24)- Connected positive influence dominating set in \(k\)-regular graph
- Minimum 2-dominating sets in regular graphs
- Connected domination in maximal outerplanar graphs
- New results on connected dominating structures in graphs
- Traceability of connected domination critical graphs
- A greedy algorithm for the connected positive influence dominating set in k-regular graphs
- Small edge dominating sets of regular graphs
- Generalized weakly connected domination in graphs
- A new kind of domination in regular graphs
- scientific article; zbMATH DE number 5972305 (Why is no real title available?)
- Properties of regular graphs with large girth via local algorithms
- scientific article; zbMATH DE number 2011847 (Why is no real title available?)
- scientific article; zbMATH DE number 2019630 (Why is no real title available?)
- Perfect connected-dominant graphs
- scientific article; zbMATH DE number 2089976 (Why is no real title available?)
- CONNECTED SUPER DOMINATION IN GRAPHS
- Linear separation of connected dominating sets in graphs
- Algorithms and Models for the Web-Graph
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
- Connected domination in random graphs
- Inverse domination: stability, unique minimum dominating sets, and dual domination
- Connected domination versus dominating sets inducing large components
- Domination in 4-regular graphs with girth 3
- Bounds relating the weakly connected domination number to the total domination number and the matching number
This page was built for publication: Connected domination of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025488)
