The independent domination number of a random graph
Lane Clark, Darin Johnson · Discussiones Mathematicae Graph Theory · 2011
We prove a two-point concentration for the independent domination number of the random graph Gn,p provided p 2 ln(n) � 64ln((lnn)=p). occurs asymptotically almost surely (a.a.s.) if P(Gn;p has property A) ! 1 as n ! 1 . See Bollobas (2) for notation and terminology. Weber (7) showed if p = 1=2 then a.a.s. (Gn;p) is either blog2 n − log2(log2 nlnn)c + 1 or blog2 n − log2(log2 nlnn)c + 2 and a.a.s. i(Gn;p)