Konu "Detour monophonic set" için listeleme
Toplam kayıt 2, listelenen: 1-2
-
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 ... -
On the connected detour monophonic number of a graph
(Işık University Press, 2021)For a connected graph G = (V, E) of order at least two, a connected detour monophonic set S of G is called a minimal connected detour monophonic set if no proper subset of S is a connected detour monophonic set of G. The ...