CAJ | 학술논문

一个顶点集是一个Rg-点割,如果它将一个连通图分割成一些连通分支使得每个连通分支至少含有g个顶点.图G的g-外连通度(记作Rg(G))是Rg-点割的最小基数.图G的通常的点连通度和上连通度分别相应的为κ0(G)和κ1(G).本文将分别证出第一类和第二类Harary图的Rg和刻画它们的Rg-点原子部分.
일개정점집시일개Rg-점할,여과타장일개련통도분할성일사련통분지사득매개련통분지지소함유g개정점.도G적g-외련통도(기작Rg(G))시Rg-점할적최소기수.도G적통상적점련통도화상련통도분별상응적위κ0(G)화κ1(G).본문장분별증출제일류화제이류Harary도적Rg화각화타문적Rg-점원자부분.
A vertex cut that separates the connected graph into components such that every components has at least g vertices is a Rg-vertex-cut. The g-extraconnectivity of G (written κg(G)) is the minimum cardinality of Rg-vertex-cut. The usual connectivity and superconnectivity of G correspond to κ0(G) and κ1 (G), respectively. In this paper, we will determine κg and characterize the Rg-vertex-atom-part for the first and second type Harary graphs.