International Journal of Mathematics Trends and Technology
Volume 65 | Issue 5 | Year 2019 | Article Id. IJMTT-V65I5P518 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I5P518
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 some standard graphs.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] R. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Springer,2011.
[5] S. Balamurugan, A study on chromatic strong domination in graphs, Ph.D Thesis, Madurai Kamaraj University, India 2008.
[6] J.A. Bondy, U.S.R. Murthy, Graph theory with Applications, North-Holland, 1982.
[7] F. Harary : Graph Theory, Addsion Wesley, Reading, Mass, (1972).
[8] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).
[9] 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, "Closed Support of a Graph under Addition I," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 5, pp. 120-122, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I5P518
PDF 
Abstract 
Keywords 
References 
Citation