标题: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
通讯作者地址:[Wu, JC]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:Graphs and combinatorics
出版年:2013
卷:29
期:6
页码:1973-1981
DOI:10.1007/s00373-012-1182-y
关键词: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.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84886595769&doi=10.1007%2fs00373-012-1182-y&partnerID=40&md5=4ec49dea3047850df05a5131e6b93011
TOP