کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5775752 | 1631748 | 2017 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Constructing edge-disjoint Steiner paths in lexicographic product networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Dirac showed that in a (kâ1)-connected graph there is a path through each k vertices. The path k-connectivity Ïk(G) of a graph G, which is a generalization of Dirac's notion, was introduced by Hager in 1986. It is natural to introduce the concept of path k-edge-connectivity Ïk(G) of a graph G. Denote by G â H the lexicographic product of two graphs G and H. In this paper, we prove that Ï3(GâH)â¥Ï3(G)â3|V(H)|4â for any two graphs G and H. Moreover, the bound is sharp. We also derive an upper bound of Ï3(G â H), that is, Ï3(GâH)â¤min{2Ï3(G)|V(H)|2,δ(H)+δ(G)|V(H)|}. We demonstrate the usefulness of the proposed constructions by applying them to some instances of lexicographic product networks.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 308, 1 September 2017, Pages 1-10
Journal: Applied Mathematics and Computation - Volume 308, 1 September 2017, Pages 1-10
نویسندگان
Yaping Mao,