关于图的边邻域完整度若干问题的研究  

Research on the edge-neighbor-integrity of a graph

作　　者：麦安婵 

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

出　　处：《西安工程科技学院学报》2005年第2期220-223,共4页Journal of Xi an University of Engineering Science and Technology

摘　　要：用二次规划法研究图的边邻域完整度.分析图的边邻域完整度给定条件下图可能具有的最大、最小边数问题;讨论图与其破边子图的边邻域完整度之间的关系;给出圈及圈的平方的边邻域完整度.By use of the method of quadratic programming, the problem that the maximum and minmum edges (number) of a graph with a fixed edge-neighbor-(integrity) was analysed.The relationship between the edge-neighbor-(integrity) of the graph and its subgraph (was) studied. The edge-neighbor-integrity of cycles and the power of cycles (was) given.

关 键 词：图或网络的脆弱性 邻域完整度 边邻域完整度 二次规划 

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