线图的邻域完整度的界  

Bound of the Neighbor-Integrity of Line Graph

作　　者：麦安婵 

机构地区：[1]西安陆军学院数学教研室,陕西西安710108

出　　处：《宁夏大学学报（自然科学版）》2004年第3期206-208,共3页Journal of Ningxia University(Natural Science Edition)

摘　　要：利用图的边邻域完整度,讨论了其线图的邻域完整度的界,得到了以下主要结果:①设β(G)为图G的边独 立数,则VNI(L(G))≤β(G);②对于任意连通图G,有VNI(L(G))≥ENI(G)-1,且此下界可达到.The neighbor-integrity of graphs is a new invariant to quantify the “vulnerability” of graphs or networks.By use of the edge-neighbor-integrity of graph G, this paper discusses the bound of the neighbor-integrity of line graph( L(G).)The main results are ①β(G) is the edge independent number of graph G,we have VNI(L(G))≤β(G), ②For any connected G,then VNI(L(G))≥ENI(G)-1,and this lower bound can be attained.

关 键 词：图或网络的脆弱性 邻域完整度 边邻域完整度 线图 

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