نتایج جستجو برای: exact 1 step dominating set
تعداد نتایج: 3499544 فیلتر نتایج به سال:
Article history: Received 14 November 2008 Received in revised form 15 January 2012 Accepted 27 February 2012 Available online xxxx
In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. After each attack, if the guards can “move” to form a dominating set that contains the attacked vertex, then the guards have successfully defended against the attack. We wish to determine the minimum number of guards required to successfully defend against any possible sequence...
this text carries out some ideas about exact and p− exact sequences of transformationsemigroups. some theorems like the short five lemma (lemma 1.3 and lemma 2.3) are valid here as inexact sequences of r − modules.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید