کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4651075 | 1632445 | 2007 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the connectivity of cages with girth five, six and eight
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A (δ,g)(δ,g)-cage is a regular graph of degree δδ and girth g with the least possible number of vertices. Recently, some authors have addressed the problem of studying the connectivity of cages. In this direction, it was conjectured by Fu, Huang and Rodger that every (δ,g)(δ,g)-cage is maximally connected, i.e., it is δδ-connected, and they proved this statement for δ=3δ=3. We provide a new contribution to the proof of that conjecture, by showing that every (δ,g)(δ,g)-cage with g=6,8g=6,8 is maximally connected, and by assuring either maximal connectivity or superconnectivity for some (δ,5)(δ,5)-cages.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 307, Issues 11–12, 28 May 2007, Pages 1441–1446
Journal: Discrete Mathematics - Volume 307, Issues 11–12, 28 May 2007, Pages 1441–1446
نویسندگان
X. Marcote, C. Balbuena, I. Pelayo,