Change of nullity of a graph under two operations

الملخص EN

The nullity of a graph G is the multiplicity of zero as an eigenvalue of its adjacency matrix.

an assignment of weights to the vertices of a graph, that satisfies a zero sum condition over the neighbors of each vertex, and uses maximum number of independent variables is denoted by a high zero sum weighting of the graph.

this applicable tool is used to determine the nullity of the graph.

two types of graphs are defined, and the change of their nullities is studied, namely, the graph G+ab constructed from G by adding a new vertex ab which is joint to all neighbors of both vertices a and b of G, and G•ab which is obtained from G+ab by removing both vertices a and b.