کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871139 | 1440179 | 2018 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Reliability analysis of Cayley graphs generated by transpositions
ترجمه فارسی عنوان
تجزیه و تحلیل قابلیت اطمینان گرافهای کایلی که توسط انتقال داده شده تولید می شوند
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
Let În be the symmetric group on {1,2,â¦,n} and S be the generating set of În. The corresponding Cayley graph is denoted by În(S). If all elements of S are transpositions, a simple way to depict S is via a graph, called the transposition generating graph of S, denoted by A(S) (or say simply A), where the vertex set of A is {1,2,â¦,n}, there is an edge in A between i and j if and only if the transposition (ij)âS, and În(S) is called a Cayley graph obtained from a transposition generating graphA. In this paper, by exploring and utilizing the structural properties of these Cayley graphs, we obtain that the pessimistic diagnosability of În(S) is equal to 2|E(A)|â2 if A has no triangles or 2|E(A)|â3 if A has a triangle. As corollaries, the pessimistic diagnosability of many kinds of graphs such as Cayley graphs generated by unicyclic graphs, wheel graphs, complete graphs, and tree graphs is obtained.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 244, 31 July 2018, Pages 94-102
Journal: Discrete Applied Mathematics - Volume 244, 31 July 2018, Pages 94-102
نویسندگان
Mei-Mei Gu, Rong-Xia Hao,