کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8900663 | 1631717 | 2018 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Super Rk-vertex-connectedness
دانلود مقاله + سفارش ترجمه
دانلود مقاله 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 neighbours in GâF. The Rk-vertex-connectivity of G, denoted by κk(G), is the cardinality of a minimum Rk-vertex-cut of G. In this paper, we further study the Rk-vertex-connectivity by introducing the concept, called super Rk-vertex-connectedness. The graph G is called super Rk-vertex-connectedness if, for every minimum Rk-vertex-cut S, GâS contains a component which is isomorphic to a certain graph H, where H is related to the graph G and integer k. For the Cayley graphs generated by wheel graphs, H is isomorphic to K2 when k=1 and H is isomorphic to C4 when k=2. In this paper, we show that the Cayley graphs generated by wheel graphs are super R1-vertex-connectedness and super R2-vertex-connectedness. Our studies generalize the main result in [8].
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 339, 15 December 2018, Pages 812-819
Journal: Applied Mathematics and Computation - Volume 339, 15 December 2018, Pages 812-819
نویسندگان
Xiaomin Hu, Yingzhi Tian, Jixiang Meng,