Nullity and Bounds to the Nullity of Dendrimer Graphs

Section: Research Paper
Issue
Vol. 10 No. 4 (2013): Volume 10 Issue 4
Pages
71-86

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.

Keywords:

Graph spectra, Nullity of graphs

Authors

Khidir R. Sharaf

Department of Mathematics faculty of Science, University of Zakho, Zakho - Kurdistan-Region, Iraq

Didar A. Ali

Department of Mathematics faculty of Science, University of Zakho, Zakho - Kurdistan-Region, Iraq

Identifiers

DOI: 10.33899/csmj.2013.163548

Download this PDF file
PDF

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
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

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