Nordhaus-Gaddum results for weakly convex domination number of a graph
Discussiones Mathematicae Graph Theory (2010)
- Volume: 30, Issue: 2, page 257-263
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., 1998). Zbl0890.05002
- [2] 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. Zbl0548.05055
- [3] F. Jaegar and C. Payan, Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple, Compt. Rend. Acad. Sci. Paris 274 (1972) 728-730. Zbl0226.05121
- [4] E.A. Nordhaus and J.W. Gaddum, On complementary graphs, Amer. Math. Monthly 63 (1956) 175-177, doi: 10.2307/2306658. Zbl0070.18503