Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

113

CPC
2006

91views more CPC 2006»

On the Independent Domination Number of Random Regular Graphs

15 years 2 months ago

On the Independent Domination Number of Random Regular Graphs

Download www.math.uwaterloo.ca

William Duckworth, Nicholas C. Wormald

Real-time Traffic

CPC 2006 |

claim paper

Related Content

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» Random Regular Graphs Of NonConstant Degree Independence And Chromatic Number

» The Domatic Number of Regular Graphs

» Comment on The Expectation Of Independent Domination Number Over Random Binary Trees

» Large independent sets in regular graphs of large girth

» Short Cycles in Random Regular Graphs

» On Constant Time Approximation of Parameters of Bounded Degree Graphs

» Regular graphs whose subgraphs tend to be acyclic

» Minimum independent dominating sets of random cubic graphs

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CPC
Authors	William Duckworth, Nicholas C. Wormald

Comments (0)