For any two vertices u and v in a connected graph G, a u − v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) is the length of a longest u − v monophonic path in G. For any vertex v in G, the monophonic eccentricity of v is em(v) = max {dm(u, v) : u ∈ V}. The subgraph induced by the vertices of G having minimum monophonic eccentricity is the monophonic center of G, and it is proved that every graph is the monophonic center of some graph. Also it is proved that the monophonic center of every connected graph G lies in some block of G. With regard to convexity, this monophonic distance is the basis of some detour monophonic parameters such as detour monophonic number, upper detour monophonic number, forcing detour monophonic number, etc. The concept of detour monophonic sets and detour monophonic numbers by fixing a vertex of a graph would be introduced and discussed. Various interesting results based on these parameters are also discussed in this chapter
