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.