在间谍工作中,限制性边邻域连通度和限制性邻域连通度比一般连通度和边连通度更加稳定可靠。文中提出了两个新概念:限制性邻域连通度和限制性边邻域连通度。证明了如果图G的线图L(G)是κ'NC图,那么κRNC(L(G))=λRNC(G)当且仅当G不是super-λRNC。并且证明了如果G是λpN C+1,q+1(G)连通图,那么L(G)是κpN,Cq连通的,并且κpN,Cq(L(G))=λpN C+1,q+1(G)。
The concepts of respect to p-q-restricted neighbor connectivity and p-q-restricted edge neighbor connectivity are intrduced.It is proved that a graph G with L(G) being a k′NC-graph,kRNC(L(G))=λRNC(G) if and only if G is not super-λRNC.Furthermore,if G is a λp+1,q+1NC(G)-connected graph,then it is shown that L(G) is kp,qNC-connected and kp,qNC(L(G))=λp+1,q+1NC(G).