Triple Connected Domination Number and Strong Triple Connected Domination Number of a Connected Graph
Maneesha Sakalle, Richa Jain · International Journal of Mathematics Trends and Technology · 2015
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.