A detour set  is said to be a path induced detour set of G if  has a Hamiltonian path. The minimum cardinality of a path induced detour set of G is called the path induced detour number and is denoted by  Some of its general properties are studied. A graph G is said to be a path induced detour graph if G has a path induced detour set. It is shown that for every pair of positive integers  a and b with  there exists a connected graph G such that  and  Also, we determine the path induced detour number of joins of some graphs.

detour distance, detour number, path induced detour number, path induced detour graph.