Monophonic concepts in graphs

Abstract

For any two vertices x and y in a connected graph G an newlineX y path is a monophonic path if it contains no chord and a longest newlineX y monophonic path is called an x y detour monophonic path For newlineany vertex x in G newline newline