A note on domination parameters in random graphs
From MaRDI portal
Publication:3606458
DOI10.7151/DMGT.1409zbMATH Open1156.05040OpenAlexW2165079333MaRDI QIDQ3606458FDOQ3606458
Authors: Anthony Bonato, Changping Wang
Publication date: 26 February 2009
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/259b90ba7cd12c0407289f533f938ee92f6c3f8b
Recommendations
- On the domination number of a random graph
- On the concentration of the domination number of the random graph
- The domination number of a random graph
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- Connected domination in random graphs
- scientific article; zbMATH DE number 2089976
- scientific article
- scientific article; zbMATH DE number 2230938
- On the Independent Domination Number of Random Regular Graphs
- Random procedures for dominating sets in graphs
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (10)
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- On the domination number of a random graph
- The 2-tuple dominating independent number of a random graph
- Connected domination in random graphs
- On the concentration of the domination number of the random graph
- Small domination-type invariants in random graphs
- Title not available (Why is that?)
- The independent domination number of random graph
- The domination number of a random graph
- Random procedures for dominating sets in bipartite graphs
This page was built for publication: A note on domination parameters in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606458)