On the domination number of a random graph

Electronic Journal of Combinatorics

Volumn 8, Issue 1 R, 2001, Pages 1-13

  Wieland, Ben ^a   Godbole, Anant P ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b EAST TENNESSEE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043135724     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1581     Document Type: Article

References (8)

1. N. Alon and J. Spencer, The Probabilistic Method, John Wiley, New York, 1992.
2. B. Bollobás, Random Graphs, Academic Press, New York, 1985.
3. P. Dryer, Ph.D. Dissertation, Department of Mathematics, Rutgers University, 2000.
4. C. Kaiser and K. Weber (1985), "Degrees and domination number of random graphs in the n-cube," Rostock. Math. Kolloq. 28, 18-32.
5. S. Nikoletseas and P. Spirakis, "Near optimal dominating sets in dense random graphs with polynomial expected time," in J. van Leeuwen, ed., Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, pp. 1-10, Springer Verlag, Berlin, 1994.
6. T. Haynes, S. Hedetniemi, and P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
7. T. Haynes, S. Hedetniemi, and P. Slater, eds., Domination in Graphs: Advanced Topics, Marcel Dekker, Inc., New York, 1998.
8. S. Janson, T. Luczak, and A. Ruciński, Random Graphs, Wiley, New York, 2000.