标题：On Edge Cut of Graphs Leaving Components of Order at Least Five
作者：Wu, J.;Ou, J.
作者机构：[Wu, J] School of Mathematics, Shandong University, Jinan, 250100, China;[ Ou, J] Department of Mathematics, Wuyi University, Jiangmen, 529020, China
通讯作者地址：[Wu, JC]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源：Graphs and combinatorics
关键词：Graph;Restricted edge connectivity;Restricted edge cut
摘要：An edge cut of a connected graph is 5-restricted if its removal leaves every component having order at least five. Graphs that contain 5-restricted edge cuts are characterized in this paper. As a result, it is shown that a connected graph G of order at least 13 contains 5-restricted edge cuts if and only if G\\v contains a component of order at least five for every vertex v of graph G.