周长为3的m限制边割连通图
주장위3적m한제변할련통도
m-restricted Edge cut of Graphs with 3 Circumference
  • 万方数据
    数学的实践与认识 수학적실천여인식
    MATHEMATICS IN PRACTICE AND THEORY
    2009年 18期 183-185 ,共3页

    王经雨%朱铁丹

    왕경우%주철단

    图%周长%边连通性 圖%週長%邊連通性
    도%주장%변련통성
    graph%circumference%restricted edge connectivity
    如果连通图的G存在边割S,使得G-S的每一个连通分支都含有至少m个顶点,则称图G是m限制边连通的.本文刻画了周长为3的m限制边连通图.
    여과련통도적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.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문