Başlık için JAEM 2017, Vol 7, No 1 listeleme
Toplam kayıt 17, listelenen: 16-17
-
Partitioning a graph into monopoly sets
(Işık University Press, 2017)In a graph G = (V, E), a set M ⊆ V (G) is said to be a monopoly set of G if every vertex v ∈ V − M has, at least, d(v)/2 neighbors in M. The monopoly size of G, denoted by mo(G), is the minimum cardinality of a monopoly ... -
Solutions of complex equations with adomian decomposition method
(Işık University Press, 2017)In this study, first order linear complex differential equations have been solved with adomian decomposition method.