Some inequalities about connected domination number

Discrete Mathematics

Volumn 159, Issue 1-3, 1996, Pages 241-245

  Bo, Cheng ^a   Liu, Bolian ^a  

^a SOUTH CHINA NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006212644     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00088-E     Document Type: Article

References (8)

1. R.B. Allan, R. Laskar and S.T. Hedetniemi, A note on total domination, Discrete Math. 49 (1984) 7-13.
2. R.B. Allan and R. Laskar, On domination and some related topics in graph theory, Proc. 9th S.E. Conf. on combinatorics, Graph Theory and Computing, Utilitas Math. (Winnipeg, 1978) 43-48.
3. B. Bollobás and E.J. Cockayne, Graph-theoretic parameters, concerning domination, independence and irredundance, J. Graph Theory 3 (1979) 241-249
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976).
5. E.J. Cockayne and S.T. Hedetniemi, Independence graphs, in: Proc. 5th S.E. Conf. on Combinatorics, Graph Theory and Computing, Utilitas Math. (1974) 471-491.
6. E.J. Cockayne, S.T. Hedetniemi and D.J. Miller, Properties of hereditary hypergraphs and Middle graphs, Canad. Math. Bull. 21 (1978) 461-468.
7. P. Duchet and H. Meyniel, On Hadwiger's number and stability number, Ann. Discrete Math. 13 (1982) 71-74.
8. S.T. Hedetniemi and R. Laskar, Connected domination in graphs, in: B. Bollobás, ed., Graph Theory and Combinatorics (Academic Press, London, 1984) 209-218.