کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8903443 | 1632568 | 2017 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Restrained Domination in Some Subclasses of Chordal Graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A set DâV of a graph G = (V, E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V\D. The Minimum Restrained Domination problem is to find a restrained dominating set of minimum cardinality. The decision version of the Minimum Restrained Domination problem is known to be NP-complete for chordal graphs. In this paper, we strengthen this NP-completeness result by showing that the problem remains NP-complete for doubly chordal graphs, a subclass of chordal graphs. We also propose a polynomial time algorithm to solve the Minimum Restrained Domination problem in block graphs, a subclass of doubly chordal graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 63, December 2017, Pages 203-210
Journal: Electronic Notes in Discrete Mathematics - Volume 63, December 2017, Pages 203-210
نویسندگان
Arti Pandey, B.S. Panda,