Connected domination in random graphs
From MaRDI portal
(Redirected from Connected domination in random graphs)
Recommendations
Cites work
- A note on domination parameters in random graphs
- Approximation algorithms for connected dominating sets
- Connected Domination and Spanning Trees with Many Leaves
- Connected domination of regular graphs
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Making a dominating set of a graph connected
- On Hadwiger's Number and the Stability Number
- On the concentration of the domination number of the random graph
- On the domination number of a random graph
- Random Graphs
- Random graphs.
- Transversal numbers of uniform hypergraphs
Cited in
(4)
This page was built for publication: Connected domination in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6107484)