Triple Connected Domination Number and Strong Triple Connected Domination Number of a Connected Graph

Dr. Maneesha Sakalle; Richa Jain

doi:https://doi.org/10.14445/22315373/IJMTT-V28P503

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 28 | Number 1 | Year 2015 | Article Id. IJMTT-V28P503 | DOI : https://doi.org/10.14445/22315373/IJMTT-V28P503

Triple Connected Domination Number and Strong Triple Connected Domination Number of a Connected Graph

Dr. Maneesha Sakalle, Richa Jain

Citation :

Dr. Maneesha Sakalle, Richa Jain, "Triple Connected Domination Number and Strong Triple Connected Domination Number of a Connected Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 28, no. 1, pp. 9-11, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V28P503

Abstract

The concept of connectedness plays crucial role in any meshing. A variety of connectedness has been studied in the literature by considering the existence of a path between any two vertices. A communication network in which a communicating node can send a message to two stations at one stretch will be more effective and economic. Such an optimization leads to the concept of triple connected graphs. In [1] G. Mahadevan et. al. introduced the concept of triple connected domination number of a graph. In this paper, we discuss the result about triple connected domination number, strong triple connected domination number of graph G and their relationship with other graph theoretical parameters.

Keywords

Adjacency matrix, degree of vertex, Path.

References

[1] G. Mahadevan, A. Selvam, J. Joseph Paulraj and T. Subramanian, “Triple Connected Domination Number of a Graph”, International J. Math. Combin. pp.93-104[2012], vol.3
[2] G. Mahadevan, V.G. Bhagavati Ammal, “Restrained Triple Connected Domination Number of Cartesian Products of Paths” International Journal of Emerging Technology in Computer Science and Electronics, [2015] vol.12
[3] G. Mahadevan, A. Selvam, A.Bibi Mydeen and T. Subramanian, “Complementary Perfect Triple Connected Domination Number of a Graph”, International Journal of Engineering Research and Application, pp. 260-265[2012], vol.2
[4] G. Mahadevan, A. Selvam, A. Rajeswari and T. Subramanian, “Paired Triple Connected Domination Number of a Graph”, International Journal of Computational Engineering Research, pp. 1333-1338[2012], vol.2
[5] J.John, P.Arul Paul Sudhahar “ The Upper Connected Monophonic Number and Forcing Connected Monophonic Number of a Graph”, International Journal of Mathematics Trends and Techonolgy, pp.29-33[2012], vol.3(1)
[6] J. Paulraj Joseph, M.K. Angel Jebitha, P. Chithra Devi and G. Sudhana, “Triple Connected Graphs”, Indian Journal of Mathematics and Mathematical Sciences, pp.61-75[2012], vol.8
[7] L. Jethruth Emelda Mary, R. Rajlakshmi, “Triple Connected Complementry Tree Domination Number of a Graph”, International Journal of Computing Algorithm, pp.861-863[2014], vol.3
[8] M.K. Angel Jebitha “Domination Uniform Subdivision Number of Graph”, International Journal of Mathematics Trends and Techonolgy, pp.1-5[2015], vol.27