FIGURE 1. A min-TDS of C(P7)
FIGURE 2. A min-TDS of C(C7)
FIGURE 3. A min-TDS of C(K3,4)
FIGURE 4. A min-TDS of C(K2,2,3)
FIGURE 5. A min-TDS of C(P4 ◦ P1)
FIGURE 6. A min-TDS of C(S1,3,3)
FIGURE 7. A min-TDS of C(W6)
References
- G. Chartrand and P. Zhang, Introduction to Graph Theory, McGraw-Hill, Kalamazoo, MI, 2004,
- E. J. Cockayne, R. M. Dawes, and S. T. Hedetniemi, Total domination in graphs, Networks 10 (1980), no. 3, 211-219. https://doi.org/10.1002/net.3230100304
- M. A. Henning and A. Yeo, Total Domination in Graphs, Springer Monographs in Mathematics, Springer, New York, 2013. https://doi.org/10.1007/978-1-4614-6525-6
- E. A. Nordhaus and J. W. Gaddum, On complementary graphs, Amer. Math. Monthly 63 (1956), 175-177. https://doi.org/10.2307/2306658
- J. V. Vernold, Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs, Ph.D Thesis, Bharathiar University, Coimbatore, India, 2007.
- D. B. West, Introduction to Graph Theory, Prentice Hall, Inc., Upper Saddle River, NJ, 1996.