On the domination number of a random graph

zbMath0989.05108MaRDI QIDQ5950386

Ben Wieland, Anant P. Godbole

Publication date: 11 December 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121890

zbMATH Keywords

random graphdomination number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (19)

Bounds on the maximum number of minimum dominating sets ⋮ The bondage number of random graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ Graphs with diameter 2 and large total domination number ⋮ Cops and Robber game with a fast robber on expander graphs and random graphs ⋮ Distributed algorithms for random graphs ⋮ Connected domination in random graphs ⋮ Minimum Degree and Dominating Paths ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ On roman, global and restrained domination in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ Onk-tuple domination of random graphs ⋮ Vertex Pursuit Games in Stochastic Network Models ⋮ Approximating the minimum independent dominating set in perturbed graphs ⋮ An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm ⋮ On the Concentration of the Domination Number of the Random Graph ⋮ Sharp concentration of hitting size for random set systems ⋮ The 2-tuple dominating independent number of a random graph

This page was built for publication: On the domination number of a random graph