کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
419783 683861 2009 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Forwarding index of cube-connected cycles
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Forwarding index of cube-connected cycles
چکیده انگلیسی

For a given connected graph GG of order vv, a routing RR in GG is a set of v(v−1)v(v−1) elementary paths specified for every ordered pair of vertices in GG. The vertex (resp. edge) forwarding index of GG is the maximum number of paths in RR passing through any vertex (resp. edge) in GG. Shahrokhi and Székely [F. Shahrokhi, L.A. Székely, Constructing integral flows in symmetric networks with application to edge forwarding index problem, Discrete Applied Mathematics 108 (2001) 175–191] obtained an asymptotic formula for the edge forwarding index of nn-dimensional cube-connected cycle CCCnCCCn as 54n22n(1−o(1)). This paper determines the vertex forwarding index of CCCnCCCn as 74n22n(1−o(1)) asymptotically.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 157, Issue 1, 6 January 2009, Pages 1–7
نویسندگان
, , ,