The Detour Monophonic Convexity Number of a Graph

Abstract

A set is detour monophonic convexif The detour monophonic convexity number is denoted by is the cardinality of a maximum proper detour monophonic convex subset of Some general properties satisfied by this concept are studied. The detour monophonic convexity number of certain classes of graphs are determined. It is shown that for every pair of integers and with there exists a connected graph such that and , where is the monophonic convexity number of G

Keywords

• convex, detour, chord, detour monophonic path, monophonic convexity number, detour monophonic, convexity number.