On the Independent Domination Number of Random Regular Graphs

A dominating set $\cal D$ of a graph $G$ is a subset of $V(G)$ such that, for every vertex $v\in V(G)$, either in $v\in {\cal D}$ or there exists a vertex $u \in {\cal D}$ that is adjacent to $v$. We are interested in finding dominating sets of small cardinality. A dominating set $\cal I$ of a graph...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Combinatorics, probability & computing probability & computing, 2006-07, Vol.15 (4), p.513-522
Hauptverfasser:	DUCKWORTH, W., WORMALD, N. C.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!