The dominating number of a random cubic graph
From MaRDI portal
Publication:4851928
DOI10.1002/rsa.3240070303zbMath0839.05085MaRDI QIDQ4851928
Michael S. O. Molloy, Bruce A. Reed
Publication date: 17 October 1995
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240070303
algorithm; dominating number; random cubic graphs; dominating set; random pairs; random 3-regular graph
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Domination in Cubic Graphs of Large Girth, Properties of on-line social systems, An upper bound on the domination number of a graph with minimum degree 2, Connected domination of regular graphs, On the domination number of generalized petersen graphs \(P(n,2)\), On certain spanning subgraphs of embeddings with applications to domination, Domination number of cubic graphs with large girth
Cites Work