Volume :7 , Issue :3 ,Page : 78–85

Abstract :A set ܸ⊆ܵ of vertices in a graph G = (V, E) is ca lled [1,2] dominating set, if every vertex 1൑,ܵെܸ∈ݒ | ܵሻ∩ݒሺܰ | ൑2, that is, every vertex in V – S is adj acent to ateast one vertex and at most two vertices in S. A [1, 2] dominating set is said to be a triple connected [1,2] dominating set if < S > is triple connected. The minimum cardinality ta ken over all the triple connected [1,2] dominating sets is called the triple connected [1,2 ] domination number and is denoted by [1,2]tc (G). In this paper, we extend the study of this parameter.