Ara
Toplam kayıt 31, listelenen: 31-31
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 ...