کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871491 | 1440186 | 2018 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A kind of conditional connectivity of transposition networks generated by k-trees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
For a graph G=(V,E), a subset FâV(G) is called an Rk-vertex-cut of G if GâF is disconnected and each vertex uâV(G)âF has at least k neighbors in GâF. The Rk-vertex-connectivity of G, denoted by κk(G), is the cardinality of the minimum Rk-vertex-cut of G, which is a refined measure for the fault tolerance of network G. In this paper, we study κ2 for Cayley graphs generated by k-trees. Let Sym(n) be the symmetric group on {1,2,â¦,n} and T be a set of transpositions of Sym(n). Let G(T) be the graph on n vertices {1,2,...,n} such that there is an edge ij in G(T) if and only if the transposition ijâT. The graph G(T) is called the transposition generating graph of T. We denote by Cay(Sym(n),T) the Cayley graph generated by G(T). The Cayley graph Cay(Sym(n),T) is denoted by TkGn if G(T) is a k-tree. We determine κ2(TkGn) in this work. The trees are 1-trees, and the complete graph on n vertices is a nâ1-tree. Thus, in this sense, this work is a generalization of the results on Cayley graphs generated by transposition generating trees (Yang et al., 2010) and the complete-transposition graphs (Wang et al., 2015).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 237, 11 March 2018, Pages 132-138
Journal: Discrete Applied Mathematics - Volume 237, 11 March 2018, Pages 132-138
نویسندگان
Weihua Yang,