کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
421234 684163 2012 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Super restricted edge connectivity of regular edge-transitive graphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Super restricted edge connectivity of regular edge-transitive graphs
چکیده انگلیسی

An edge cut of a connected graph is called restricted   if it separates this graph into components each having order at least 2; a graph GG is super restricted edge connected   if G−FG−F contains an isolated edge for every minimum restricted edge cut FF of GG. It is proved in this paper that a connected regular edge-transitive graph of valency at least 3 is not super restricted edge connected if and only if it is either the three dimensional hypercube, or a tetravalent edge-transitive graph of girth 3 and of order at least 6. As a result, there are infinitely many kk-regular Hamiltonian graphs with k≥3k≥3 which are not super restricted edge connected. This answers negatively a question in [J. Ou, F. Zhang, Super restricted edge connectivity of regular graphs, Graphs & Combin. 21 (2005) 459–467] regarding the relationship between restricted edge connected graphs and Hamiltonian graphs.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 160, Issues 7–8, May 2012, Pages 1248–1252
نویسندگان
,