For a connected graph G = (V,E), a detour set S ⊆ V(G) is called a total detour set of G if the subgraph G[S] induced by S has no isolated vertices. The total detour number tdn(G) of G is the minimum order of its total detour sets and any total detour set of order tdn(G) is called a td-set of G. In this paper, the total detour number of some path related graphs are found and compared with their detour numbers.