Minimum connected dominating sets of random cubic graphs
From MaRDI portal
Publication:5958835
zbMath0986.05089MaRDI QIDQ5958835
Publication date: 4 March 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121821
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Randomized greedy algorithms for finding smallk-dominating sets of regular graphs ⋮ Connected domination of regular graphs
This page was built for publication: Minimum connected dominating sets of random cubic graphs
