کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4648121 | 1342394 | 2012 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Edge-connectivity of permutation hypergraphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Edge-connectivity of permutation hypergraphs Edge-connectivity of permutation hypergraphs](/preview/png/4648121.png)
چکیده انگلیسی
In this note we provide a generalization of a result of Goddard et al. (2003) [4] on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph GπGπ is obtained from a hypergraph GG by taking two disjoint copies of GG and by adding a perfect matching between them. The main tool in the proof of the graph result was the theorem on partition constrained splitting off preserving kk-edge-connectivity due to Bang-Jensen et al. (1999) [1]. Recently, this splitting off theorem was extended for hypergraphs by Bernáth et al. (accepted in Journal of Graph Theory) [2]. This extension made it possible to find a characterization of hypergraphs for which there exists a kk-edge-connected permutation hypergraph.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 312, Issue 17, 6 September 2012, Pages 2536–2539
Journal: Discrete Mathematics - Volume 312, Issue 17, 6 September 2012, Pages 2536–2539
نویسندگان
Neil Jami, Zoltán Szigeti,