|
|||||
|
|
The dominating number of a random cubic graph |
|
| Authors: | Michael Molloy Bruce Reed |
| Abstract: | We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636n ≤ D(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc. |
| Keywords: | |
