周长为3的m限制边割连通图  

m-restricted Edge cut of Graphs with 3 Circumference

作　　者：王经雨[1] 朱铁丹[1] 

机构地区：[1]五邑大学数理系,广东江门529020

出　　处：《数学的实践与认识》2009年第18期183-185,共3页Mathematics in Practice and Theory

基　　金：国家自然科学基金(10801091)

摘　　要：如果连通图的G存在边割S,使得G-S的每一个连通分支都含有至少m个顶点,则称图G是m限制边连通的.本文刻画了周长为3的m限制边连通图.An m-restricted edge cut is an edge cut of a connected graph which disconnects this graph with each component having order at least m, the paper characterize m-restricted edge cut of graphs with 3 circumference.

关 键 词：图 周长 边连通性 

分 类 号：O157.5[理学—数学]