The dominating number of a random cubic graph

DOI10.1002/rsa.3240070303zbMath0839.05085OpenAlexW2037318072MaRDI 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

zbMATH Keywords

algorithmdominating numberrandom cubic graphsdominating setrandom pairsrandom 3-regular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Domination in Cubic Graphs of Large Girth ⋮ Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ 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)\) ⋮ Domination number of cubic graphs with large girth ⋮ On certain spanning subgraphs of embeddings with applications to domination

Cites Work

• Weighted sums of certain dependent random variables
• Generating and Counting Hamilton Cycles in Random Regular Graphs

This page was built for publication: The dominating number of a random cubic graph