Tight upper bounds for the domination numbers of graphs with given order and minimum degree

Electronic Journal of Combinatorics

Volumn 4, Issue 1 R, 1997, Pages 1-24

  Clark, W Edwin ^a   Dunning, Larry A ^b  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

^b BOWLING GREEN STATE UNIVERSITY   (United States)

Author keywords

Domination number; Graph; Minimum degree; Upper bounds

Indexed keywords

EID: 4043128507     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1311     Document Type: Article

References (9)

1. I. Anderson, Combinatorics of Finite Sets, Clarendon Press, Oxford, New York, 1987.
2. W. E. Clark, D. Fisher, B. Shekhtman and S. Suen, Upper bounds for the domination number of a graph, preprint.
3. J. F. Fink, M. S. Jacobson, L. K. Kinch and J. Roberts, On graphs having domination number half their order, Period. Math. Hungar. 16 (1985), 287-293.
4. T. W. Haynes, Domination in graphs: a brief overview, preprint.
5. W. McCuaig and B. Shepherd, Domination in graphs with minimum degree two, J. Graph Theory 13 (1989), 749-762.
6. B. D. McKay, Isomorph-free exhaustive generation, preprint.
7. O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, American Mathematical Society, Providence, 1962.
8. C. Payan and N. H. Xuong, Domination-balanced graphs, J. Graph Theory 6 (1982), 23-32.
9. B. Reed, Paths, stars, and the number three, Combin. Probab. and Comput. 5 (1996), 277-295.