کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4636978 | 1340732 | 2006 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A recursively construction scheme for super fault-tolerant hamiltonian graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k â 2 vertices and/or edges and remains hamiltonian connected after removing at most k â 3 vertices and/or edges. A super fault-tolerant hamiltonian graph has a certain optimal flavor with respect to the fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity. The aim of this paper is to investigate a construction scheme to construct various super fault-tolerant hamiltonian graphs. Along the way, the recursive circulant graph is a special case of our construction scheme, and the super fault-tolerant hamiltonian property of recursive circulant graph is obtained.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 177, Issue 2, 15 June 2006, Pages 465-481
Journal: Applied Mathematics and Computation - Volume 177, Issue 2, 15 June 2006, Pages 465-481
نویسندگان
Y-Chuang Chen, Lih-Hsing Hsu, Jimmy J.M. Tan,