کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1142387 | 957145 | 2012 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On orienting graphs for connectivity: Projective planes and Halin graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On orienting graphs for connectivity: Projective planes and Halin graphs On orienting graphs for connectivity: Projective planes and Halin graphs](/preview/png/1142387.png)
چکیده انگلیسی
Nash-Williams proved that the edges of a kk-edge connected (undirected) graph can be oriented such that the resulting directed graph is ⌊k2⌋-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity, element connectivity, and hypergraph edge connectivity. We focus on two special classes of graphs, namely, incidence graphs of projective planes and (generalized) Halin graphs, and we prove some analogs of Nash-Williams’ result for these classes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 40, Issue 5, September 2012, Pages 337–341
Journal: Operations Research Letters - Volume 40, Issue 5, September 2012, Pages 337–341
نویسندگان
Joseph Cheriyan, Chenglong Zou,