Let be a graph. A triple connected dominator coloring of a graph is a proper three coloring of in which every vertex dominates every vertex of atleast one color class. The minimum number of colors required for a triple connected dominator coloring set of is called the triple connected dominator chromatic number of and is denoted by The concept of triple umpiring system (TUS) by considering the existence of path containing any three vertices (node) of a graph using triple connected dominator coloring sets. In our system each node’s behavior from source to destination is closely monitored by a set of three umpires. If any misbehavior is noticed umpires flag off the guilty node from the circuit. We have proposed backtracking algorithm to exemplify the basic TUS for salvaging, the circuit during disruptions in route reply and data forwarding phases. In this paper, we obtain bounds for standard graphs and characterize the corresponding special graphs.