Browsing Jaem 2016, Vol 6, No 1 by Citation "Titus, P., Santhakumaran, A. P. & Ganesamoorthy, K. (2016). The connected detour monophonic number of a graph. TWMS Journal of Applied and Engineering Mathematics, 6(1), 75-86."
Now showing items 1-1 of 1
(Işık University Press, 2016)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 − y monophonic path ...