Let G be a connected graph with atleast two vertices. Let M⊆V be an open detour monophonic set of G. A subset T⊆M is called a forcing subset for M if M is the unique minimum open detour monophonic set containing T. A forcing open detour monophonic subset for M is the minimum cardinality of a minimum forcing subset of M, denoted by fodm(M), is the cardinality of a minimum forcing subset of M. The forcing open detour monophonic number of G, denoted by fodm(G). fodm(G)=min⁡{fodm(M)}, where the minimum is taken over all odm-set M of G.In this paper, we determined the forcing open detour monophonic number of some standard graphs and obtained some results. It is shown that for every pair of integersa and b with 0⁡≤⁡a≤b,b≥2 and b−a>3, there exists a connected graph G such that fodm(G)=aand odm(G)=b.