کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647564 | 1342359 | 2013 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Average connectivity and average edge-connectivity in graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Average connectivity and average edge-connectivity in graphs Average connectivity and average edge-connectivity in graphs](/preview/png/4647564.png)
چکیده انگلیسی
Connectivity and edge-connectivity of a graph measure the difficulty of breaking the graph apart, but they are very much affected by local aspects like vertex degree. Average connectivity (and analogously, average edge-connectivity ) has been introduced to give a more refined measure of the global “amount” of connectivity. In this paper, we prove a relationship between the average connectivity and the matching number in all graphs. We also give the best lower bound for the average edge-connectivity over nn-vertex connected cubic graphs, and we characterize the graphs where equality holds. In addition, we show that this family has the fewest perfect matchings among cubic graphs that have perfect matchings.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 20, 28 October 2013, Pages 2232–2238
Journal: Discrete Mathematics - Volume 313, Issue 20, 28 October 2013, Pages 2232–2238
نویسندگان
Jaehoon Kim, Suil O,