الملخص

In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph   for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and  star graphs.  Finally, we introduce and prove a sharp lower and a sharp upper bound for the nullity of the coalescence graph of two graphs.