The domination number of a random graph

MaRDI QIDQ2878223zbMATH OpenFDO

Authors Michael A. Henning, A. Yeo

Publication date 28 August 2014

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

diameter twototal domination number

Mathematics Subject Classification ID

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

Recommendations

• On the domination number of a random graph
• On the tree domination number of a random graph.
• A note on domination parameters in random graphs
• Connected domination in random graphs
• On the concentration of the domination number of the random graph

Cited in

(14)

• Bounds on domination parameters in graphs: a brief survey
• On 2-step and hop dominating sets in graphs
• Graphs with diameter 2 and large total domination number
• The domination number of on-line social networks and random geometric graphs
• The independent domination number of random graph
• The 2-tuple dominating independent number of a random graph
• On the tree domination number of a random graph.
• A note on domination parameters in random graphs
• scientific article; zbMATH DE number 553912 (Why is no real title available?)
• scientific article; zbMATH DE number 1750102 (Why is no real title available?)
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
• On the concentration of the domination number of the random graph
• On the domination number of a random graph
• Connected domination in random graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878223)