CAJ | 학술논문

讨论了顺次联图邻域完整度的一些性质.设S是图G的一个点子集,如果从G中删去S的闭邻域中所有点,则称S为G的一个点颠覆策略.记幸存子图为G/S,图G的邻域完整度定义为VNI(G)=minS( )V(G){|S|+m(G/S)},其中S为G的任意一个点颠覆策略,m(G/S)表示G/S的最大连通分支所含点数.
토론료순차련도린역완정도적일사성질.설S시도G적일개점자집,여과종G중산거S적폐린역중소유점,칙칭S위G적일개점전복책략.기행존자도위G/S,도G적린역완정도정의위VNI(G)=minS( )V(G){|S|+m(G/S)},기중S위G적임의일개점전복책략,m(G/S)표시G/S적최대련통분지소함점수.
A vertex subversion strategy of a graph G is a vertex set S of V (G) whose closed neighborhood is deleted from G. The survival subgraph is denoted by G/S. The vertex-neighbor-integrity of G is defined to be VNI(G)=minS( )V (G){|S+m(G/S)},where S is any vertex subversion strategy of G and m(G/S) is the maximum order of the component of G/S. In this paper, the properties of vertex-neighbor-integrity of sequential-joined graphs are discussed.