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.

• 摘要本文用二次整数规划法研究给定邻域完整度的图可能具有的最大边数问题。