The independent domination number of a random graph
From MaRDI portal
Publication:3171421
DOI10.7151/DMGT.1533zbMATH Open1284.05244OpenAlexW2084018888MaRDI QIDQ3171421
Publication date: 5 October 2011
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1533
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph ⋮ Robust domination in random graphs ⋮ The 2-tuple dominating independent number of a random graph
This page was built for publication: The independent 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 Q3171421)
