The independent domination number of maximal triangle-free graphs

Australasian Journal of Combinatorics

Volumn 42, Issue , 2008, Pages 129-136

  Wang, Changping ^a  

^a RYERSON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77950519939     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. C. Barefoot, K. Casey, D. Fisher, K. Fraughnaugh and F. Harary, Size in maximal triangle-free graphs and minimal graphs of diameter 2, Discrete Math. 138 (1995), 93-99.
2. G. Chartrand and L. Lesniak, Graphs & Digraphs, Chapman & Hall/CRC, 2000.
3. O. Favaron, Two relations between the parameters of independence and irre-dundance, Discrete Math. 70 (1988), 17-20.
4. J. Gimbel and P.D. Vestergaard, Inequalities for total matchings of graphs, Ars Combin. 39 (1995), 109-119.
5. J. Haviland, Independent domination in regular graphs, Discrete Math. 143 (1995), 275-280.
6. J. Haviland, Upper bounds for independent domination in regular graphs, Discrete Math. 307 (2007), no. 21, 2643-2646.
7. J. Haviland, Independent domination in triangle-free graphs, Discrete Math. 308 (2008), no. 16, 3545-3550.
8. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
9. T.W. Haynes, S.T. Hedetniemi and P.J. Slater (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
10. P.C.B. Lam, W.C. Shiu and L. Sun, On independent domination number of regular graphs, Discrete Math. 202 (1999), 135-144.
11. L. Sun and J. Wang, An upper bound for the independent domination number, J. Combin. Theory Ser. B 76 (1999), 240-246.
12. P. Tuŕan, On the theory of graphs, Colloq. Math. 3 (1954), 19-30.