Search
Now showing items 1-1 of 1
The connected detour monophonic number of a graph
(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 ...