کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1710582 | 1012895 | 2006 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Degree sequence conditions for maximally edge-connected oriented graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
If DD is a digraph, δ(D)δ(D) its minimum degree and λ(D)λ(D) its edge-connectivity, then λ(D)≤δ(D)λ(D)≤δ(D). A digraph DD is called maximally edge-connected if λ(D)=δ(D)λ(D)=δ(D). A digraph without any directed cycle of length 2 is called an oriented graph. Sufficient conditions for digraphs to be maximally edge-connected have been given by several authors. However, closely related conditions for maximally edge-connected oriented graphs have received little attention until recently. In this work we will present some degree sequence conditions for oriented graphs as well as for oriented bipartite graphs to be maximally edge-connected.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics Letters - Volume 19, Issue 11, November 2006, Pages 1255–1260
Journal: Applied Mathematics Letters - Volume 19, Issue 11, November 2006, Pages 1255–1260
نویسندگان
Lutz Volkmann,