A graph G is said to be triple connected if any three vertices lie on a path in G.
A dominating set S of a connected graph G is said to be a triple connected dominating set
of G if the induced subgraph hSi is triple connected.