کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
13430942 | 1842442 | 2019 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Classes of uniformly most reliable graphs for all-terminal reliability
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The all-terminal reliability polynomial of a graph G is the probability that G remains connected if each edge is independently included with fixed probability p. Among all graphs with a fixed number of n vertices and m edges, a graph is uniformly most reliable if its reliability polynomial is greater than or equal to all other graphs on the same number of vertices and edges for every value of pâ[0,1]. We find a new class of graphs that are uniformly most reliable. Specifically, we show that when nâ¥5 is odd and m is either n2ân+12 or n2ân+32, there exists a unique uniformly most reliable graph, and we give its construction.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 267, 31 August 2019, Pages 12-29
Journal: Discrete Applied Mathematics - Volume 267, 31 August 2019, Pages 12-29
نویسندگان
Kassie Archer, Christina Graves, David Milan,