نتایج جستجو برای: paired domination number
تعداد نتایج: 1216065 فیلتر نتایج به سال:
A total dominating set of a graph G with no isolated vertices is subset S the vertex such that every adjacent to in S. The domination number minimum cardinality set. In this paper, we study middle graphs. Indeed, obtain tight bounds for terms order graph. We also compute some known families graphs explicitly. Moreover, Nordhaus-Gaddum-like relations are presented
for every positive integer k, a set s of vertices in a graph g = (v;e) is a k- tuple dominating set of g if every vertex of v -s is adjacent to at least k vertices and every vertex of s is adjacent to at least k - 1 vertices in s. the minimum cardinality of a k-tuple dominating set of g is the k-tuple domination number of g. when k = 1, a k-tuple domination number is the well-studied domination...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید