과제정보
The authors are thankful to the referee for the useful suggestions.
참고문헌
- S. Balamurugan, P. Aristotle and V. Swaminathan, On Graphs whose Dom-chromatic and chromatic Strong Domination number is up to Four, International Journal of Pure and Applied Mathematics 119 (2018), 61-68.
- B. Chaluvaraju and C. Appajigowda, The Dom-chromatic Number of a graph, Malaya Journal of Matematik 4 (2016), 1-7. https://doi.org/10.26637/mjm401/001
- Gary Chartrand and Ping Zhang, Chromatic Graph Theory, CRC Press, Taylor & Francis Group, 2009.
- F. Harary, Graph Theory, Addison-Wesley, Reading Mass, 1969.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in graphs; Advanced topics, Marcel Dekker, New York, 1998.
- T.R. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons, Inc, New York, 1995.
- V.R. Kulli, and B. Janakiram, The non-split domination number of a graph, Indian journal of pure and applied mathematics 31 (2000), 441-448.
- S. Muthammai, M. Bhanumathi, and P. Vidhya, Complementary tree domination number of a graph, International Mathematical Forum 6 (2011).
- P.A. Safeer, A. Sadiquali, K.R. Santhoshkumar, The Split (D, C) Number of a Graph and related properties, Communicated to the Journal, 2023, Under review.
- T. Tamizh Chelvam, and S. Robinson Chellathurai, A note on split domination number of a graph, Journal of Discrete Mathematical Sciences and Cryptography 12 (2009), 179-186. https://doi.org/10.1080/09720529.2009.10698228