Nullity and Bounds to the Nullity of Dendrimer Graphs

Section: Research Paper

Abstract

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.

References

Download this PDF file

Statistics

How to Cite

Nullity and Bounds to the Nullity of Dendrimer Graphs. (2013). AL-Rafidain Journal of Computer Sciences and Mathematics, 10(4), 71-86. https://doi.org/10.33899/csmj.2013.163548
Copyright and Licensing

How to Cite

Nullity and Bounds to the Nullity of Dendrimer Graphs. (2013). AL-Rafidain Journal of Computer Sciences and Mathematics, 10(4), 71-86. https://doi.org/10.33899/csmj.2013.163548