Strong (Weak) Triple Connected Domination Number of a Fuzzy Graph

A subset S of V of a nontrivial fuzzy graph G is said to be strong (weak) triple connected dominating set, if S is a strong (weak) dominating set and the induced sub graph is a triple connected. The minimum cardinality taken over all strong (weak) triple connected dominating set is called the strong (weak) triple connected domination number and it denoted by ?stc (?wtc).we introduce strong (weak) triple connected domination number of a fuzzy graphs and obtain some interesting results for this new parameter in fuzzy graphs.