International Journal of Mathematics Trends and Technology
Volume 65 | Issue 5 | Year 2019 | Article Id. IJMTT-V65I5P519 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I5P519
In this paper we defined closed support of a vertex 𝑣 under addition and closed support of a graph G under addition. We calculate the closed support for Dutch windmill graph, Butterfly graph and Ladder graph. Also, we generalized the value of closed support under addition for any given graph 𝐺. AMS Subject Code: 05C07
[1] M. Anitha, S. Balamurugan: Strong (Weak) Efficient Open Domination on Product Graphs, International Journal of Pure and Applied Mathematics, (J.No. 23425), IISN 1311 - 8080, communicated.
[2] S. Balamurugan, M. Anitha, C. Karnan and P. Aristotle: A Note on Open Support of a Graph under Addition I, Communicated
[3] S. Balamurugan, M. Anitha, C. Karnan and P. Aristotle: A Note on Open Support of a Graph under Addition II, Communicated
[4] S. Balamurugan, M. Anitha, C. Karnan and P. Palanikumar: Closed Support of a Graph Under Addition I , Communicated
[5] R. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Springer,2011.
[6] S. Balamurugan, A study on chromatic strong domination in graphs, Ph.D Thesis, Madurai Kamaraj University, India 2008.
[7] J.A. Bondy, U.S.R. Murthy, Graph theory with Applications, North-Holland, 1982.
[8] F. Harary : Graph Theory, Addsion Wesley, Reading, Mass, (1972).
[9] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).
[10] C. Y. Ponnappan: Studies in Graph Theory Support Strong Domination in Graphs, Ph.D thesis, Madurai Kamaraj University (2008).
S. Balamurugan ,M. Anitha , C. Karnan , P. Palanikumar, "Closed Support of a Graph under Addition II," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 5, pp. 123-128, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I5P519
PDF 
Abstract 
Keywords 
References 
Citation