## THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH

THE CONNECTED DETOUR MONOPHONIC NUMBER OF A

GRAPH

##
*P. TITUS, A.P. SANTHAKUMARAN, K. GANESAMOORTHY*

[**PDF**]

## Abstract

For a connected graph G = (V;E) of order at least two, a chord of a path

P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic

path if it is a chordless path. A longest x