کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6875785 | 1441986 | 2017 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by adding a special vertex linked to all its three extreme vertices. In this paper, we study analytically maximum matchings and minimum dominating sets in Apollonian networks and their dual graphs, both of which have found vast applications in various fields, e.g. structural controllability of complex networks. For both networks, we determine their matching number, domination number, the number of maximum matchings, as well as the number of minimum dominating sets.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 703, 5 December 2017, Pages 37-54
Journal: Theoretical Computer Science - Volume 703, 5 December 2017, Pages 37-54
نویسندگان
Yujia Jin, Huan Li, Zhongzhi Zhang,