Minimum Degree Condition for the Optimization of Restricted Edge Connectivity of Regular Graphs
Ou Jian · Neimenggu Shi-da xuebao. Zhexue shehui kexue hanwen ban · 2003
Restricted edge cut separates a connected graph into a disconnected one without isolated vertex.Graph G is super restricted edge connected if no subgraph but an isolated edge can be separated by any minimum restricted edge cut.It is proved that k regular connected graph G is super restricted edge connected if k|G|/2+1 . The lower bound on k is exemplified to be sharp to some extent.