Künye "Naji, A. M. & Nandappa D., S. (2017). Partitioning a graph into monopoly sets. TWMS Journal Of Applied And Engineering Mathematics, 7(1), 154-164." JAEM 2017, Vol 7, No 1 için listeleme
Toplam kayıt 1, listelenen: 1-1
-
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 ...