کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4653078 | 1632606 | 2006 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Global offensive alliances in graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
An offensive alliance in a graph Γ=(V,E) is a set of vertices S⊂V where for every vertex v in its boundary it holds that the majority of vertices in v's closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V\S, that is, S is a dominating set of Γ. The global offensive alliance number γo(Γ) (respectively, global strong offensive alliance number ) is the minimum cardinality of a global offensive (respectively, global strong offensive) alliance in Γ. In this paper we obtain several tight bounds on γo(Γ) and in terms of several parameters of Γ.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 25, 1 August 2006, Pages 157-164
Journal: Electronic Notes in Discrete Mathematics - Volume 25, 1 August 2006, Pages 157-164