On the Domination Number of a Random Graph

@article{Wieland2001OnTD,
  title={On the Domination Number of a Random Graph},
  author={Ben Wieland and Anant P. Godbole},
  journal={Electr. J. Comb.},
  year={2001},
  volume={8}
}
In this paper, we show that the domination number D of a random graph enjoys as sharp a concentration as does its chromatic number χ. We first prove this fact for the sequence of graphs {G(n, pn}, n → ∞, where a two point concentration is obtained with high probability for pn = p (fixed) or for a sequence pn that approaches zero sufficiently slowly. We then consider the infinite graph G(Z+, p), where p is fixed, and prove a three point concentration for the domination number with probability… CONTINUE READING

From This Paper

Topics from this paper.
40 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Random Graphs

  • S. Janson, T. Luczak, A. Ruciński
  • Wiley, New York, 2000. the electronic journal of…
  • 2001

and P

  • T. Haynes, S. Hedetniemi
  • Slater, eds., Domination in Graphs: Advanced…
  • 2001
1 Excerpt

Fundamentals of Domination in Graphs

  • T. Haynes, S. Hedetniemi, P. Slater
  • Marcel Dekker, Inc., New York
  • 1998
1 Excerpt

Degrees and domination number of random graphs in the n-cube,

  • C. Kaiser, K. Weber
  • Rostock. Math. Kolloq
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…