Triple Connected Domination Number For Some Special Graphs

Abstract

A subset S of V of a nontrivial connected graph G is said to be a triple connected dominating set (tcd-set), if S is a dominating set and the induced subgraphSis triple connected. The minimum cardinality taken over all triple connected dominating sets is called the triple connected domination number of G and is denoted by γ_tc(G). Any triple connected dominating set with γ_tc vertices is called a γ_tc-set of G. In this paper we obtain triple connected domination number for triangular snake graphs and double triangular snake graphs.