کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
977239 | 933180 | 2009 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Modeling complex networks with self-similar outerplanar unclustered graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Modeling complex networks with self-similar outerplanar unclustered graphs Modeling complex networks with self-similar outerplanar unclustered graphs](/preview/png/977239.png)
چکیده انگلیسی
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the graphs are outerplanar and it is know that many algorithms that are NP-complete for general graphs perform polynomial in outerplanar graphs. Therefore the graphs constitute a good mathematical model for these systems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 388, Issue 11, 1 June 2009, Pages 2227–2233
Journal: Physica A: Statistical Mechanics and its Applications - Volume 388, Issue 11, 1 June 2009, Pages 2227–2233
نویسندگان
Francesc Comellas, Alicia Miralles,