کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4646793 1342314 2016 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Maximally edge-connected hypergraphs
ترجمه فارسی عنوان
ابرگراف لبه متصل حداکثری
کلمات کلیدی
ابرگراف ؛ اتصال لبه؛ اتصال؛ لبه متصل حداکثری
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی

The edge-connectivity   of a connected graph or hypergraph is the minimum number of edges whose removal renders the graph or hypergraph, respectively, disconnected. The edge-connectivity of a (hyper) graph cannot exceed its minimum degree. For graphs, several sufficient conditions for equality of edge-connectivity and minimum degree are known. For example Chartrand (1966) showed that for every graph of order nn and minimum degree at least n−12 its edge-connectivity equals its minimum degree. We show that this and some other well-known sufficient conditions generalise to hypergraphs.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 339, Issue 1, 6 January 2016, Pages 33–38
نویسندگان
, ,