142 search results - page 4 / 29 » On the Independent Domination Number of Random Regular Graph... |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
CPC
2004
13 years 7 months ago
2004
DM
2006
13 years 7 months ago
2006
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
APPROX
2004
Springer
14 years 28 days ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
FCS
2009
13 years 5 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...