Connected domination and spanning trees with many leaves

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 2, 2000, Pages 202-211

  Caro, Yair ^a   West, Douglas B ^b   Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Connectivity; Domination; Spanning trees

Indexed keywords

EID: 0037904596     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199353780     Document Type: Article

References (28)

1. N. ALON, Transversal numbers of uniform hypergraphs, Graphs Combin., 6 (1990), pp. 1-4.
2. N. ALON AND J. H. SPENCER, The Probabilistic Method, John Wiley, New York, 1991.
3. L. ARSENEAU, A. FINBOW, B. HARTNELL, A. HYNICK, D. MACLEAN, AND L. O'SULLIVAN, On minimal connected dominating sets, J. Combin. Math. Combin. Comput., 24 (1997), pp. 185-191.
4. C. BO AND B. LIU, Some inequalities about the connected domination number, Discrete Math., 159 (1996), pp. 241-245.
5. B. BOLLOBÁS, Extremal Graph Theory, Academic Press, London, UK, 1978.
6. Y. CARO, On k-domination and k-transversal numbers of graphs and hypergraphs, Ars Combin., 29A (1990), pp. 49-55.
7. E.J. COCKAYNE, T.W. HAYNES, AND S.T. HEDETNIEMI, Extremal Graphs for Inequalities Involving Domination Parameters, manuscript, 1997.
8. C.J. COLBOURN AND L.K. STEWART, Permutation graphs: Connected domination and Steiner trees, Discrete Math., 86 (1990), pp. 179-189.
9. T.H. CORMEN, C.E. LEISERSON, AND R.L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
10. A. D'ATRI AND M. MOSCARINI, Distance-hereditary graphs, Steiner trees, and connected domination, SIAM J. Comput., 17 (1988), pp. 521-538.
11. P. DUCHET AND H. MEYNIEL, On Hadwiger's number and stability numbers, North-Holland Math. Stud., 62 (1982), pp. 71-73.
12. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
13. J.R. GRIGGS AND M. WU, Spanning trees in graphs with minimum degree 4 or 5, Discrete Math., 104 (1992), pp. 167-183.
14. T. HAYNES, S.T. HEDETNIEMI, AND P. SLATER, Dormination in Graphs: The Theory, Marcel Dekker Publishers, New York, 1997.
15. T. HAYNES, S.T. HEDETNIEMI, AND P. SLATER, Domination in Graphs: Selected Topics, Marcel Dekker Publishers, New York, 1997.
16. S.T. HEDETNIEMI AND R. LASKAR, Connected domination in graphs, in Graph Theory and Combinatorics, B. Bollobás, ed., Academic Press, London, UK, 1984, pp. 209-218.
17. S.T. HEDETNIEMI AND R. LASKAR, Bibliography of domination in graphs and some basic definitions of domination parameters, Discrete Math., 86 (1990), pp.257-277.
18. R.M. KARP AND V. RAMACHANDRAN, Parallel algorithms for shared memory machines, in Handbook of Theoretical Computer Science A, Chapter 17, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 869-941.
19. D. J. KLEITMAN AND D. B. WEST, Spanning trees with many leaves, SIAM J. Discrete Math., 4 (1991), pp. 99-106.
20. D.E KNUTH, The Art of Computer Programming, Addison-Wesley, Reading, MA, 1973.
21. L. LOVÁSZ, On the ratio of optimal and integral fractional covers, Discrete Math., 13 (1975), pp. 383-390.
22. W. MCCUAIG AND B. SHEPHERD, Domination in graphs with minimum degree two, J. Graph Theory, 13 (1989), pp. 749-762.
23. M. MOSCARINI, Doubly chordal graphs, Steiner trees, and connected domination, Networks, 23 (1993), pp. 59-69.
24. B. REED, Paths, stars and the number three, Combin. Probab. Comput., 5 (1996), pp. 267-276.
25. E. SAMPATHKUMAR AND H. WALIKAR, The connected domination number of a graph, J. Math. Phys. Sci., 13 (1979), pp. 607-613.
26. L.A. SANCHIS, On the Number of Edges of a Graph with a Given Connected Domination Number, manuscript, 1998.
27. Y. SHILOACH AND U. VISHKIN, An O(log n) parallel connectivity algorithm, J. Algorithms, 3 (1982), pp. 57-63.
28. K. WHITE, M. FARBER, AND W.R. PULLEYBLANK, Steiner trees, connected domination and strongly chordal graphs, Networks, 15 (1985), pp. 109-124.