给定邻域完整度的图的最大边数  

The Maximal Edge Number of a Graph with a Fixed Vertex-neighbor-integrity

作　　者：麦安婵 

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

出　　处：《工程数学学报》2006年第3期518-522,共5页Chinese Journal of Engineering Mathematics

摘　　要：本文用二次整数规划法研究给定邻域完整度的图可能具有的最大边数问题。给出图的最大边数的上界,并在此基础上得出了几个有用的推论。By using the quadratic integer programming method, the problem about the maximal edge number of a graph with a fixed vertex-neighbor-integrity is studied, The upper bound for the maximal edge number of the graph has been derived, and a few valuable corollaries are also given.

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

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