Konu "Distance" için JAEM 2015, Vol 5, No 1 listeleme
Toplam kayıt 1, listelenen: 1-1
-
Distance majorization sets in graphs
(Işık University Press, 2015)Let G = (V, E) be a simple graph. A subset D of V (G) is said to be a distance majorization set (or dm - set) if for every vertex u ∈ V − D, there exists a vertex v ∈ D such that d(u, v) ≥ deg(u) + deg(v). The minimum ...