On the Independent Domination Number of Random Regular Graphs

DOI10.1017/S0963548305007431zbMath1121.05084OpenAlexW2027384327MaRDI QIDQ5295399

William Duckworth, Nicholas C. Wormald

Publication date: 30 July 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007431

Mathematics Subject Classification ID

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

Related Items (17)

Independent domination in directed graphs ⋮ Total domination in regular graphs ⋮ Asymptotic bounds on total domination in regular graphs ⋮ On independent domination of regular graphs ⋮ The cook-book approach to the differential equation method ⋮ Induced Forests in Regular Graphs with Large Girth ⋮ Independent domination number in Cayley digraphs of rectangular groups ⋮ A structural approach for independent domination of regular graphs ⋮ Independent sets in graphs ⋮ An upper bound on the domination number of a graph with minimum degree 2 ⋮ THE DEPRIORITISED APPROACH TO PRIORITISED ALGORITHMS ⋮ Connected domination of regular graphs ⋮ Independent dominating sets in graphs of girth five ⋮ Typicality and entropy of processes on infinite trees ⋮ Minimum 2-dominating sets in regular graphs ⋮ Independent domination in signed graphs ⋮ Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs

This page was built for publication: On the Independent Domination Number of Random Regular Graphs