Nullity and bounds to the nullity of dendrimer graphs
Joint Authors
Source
al- Rafidain Journal of Computer Sciences and Mathematics
Issue
Vol. 10, Issue 4 (31 Dec. 2013), pp.71-86, 16 p.
Publisher
University of Mosul College of Computer Science and Mathematics
Publication Date
2013-12-31
Country of Publication
Iraq
No. of Pages
16
Main Subjects
Abstract AR
في هذا البحث، تم تطبيق تقنية التوزين العالي لاحتساب درجة الشذوذ للبيان (dendrimer DK) إذ أن بيان خاص، كالدارة، الدرب، البيان التام، البيان الثنائي التجزئة التام أو النجم.
أخيرا وضعنا و أثبتنا قيود حادة دنيا و عليا للبيانG2 G1 ͦ.
Abstract EN
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.
American Psychological Association (APA)
Sharaf, Khidr R.& Ali, Didar A.. 2013. Nullity and bounds to the nullity of dendrimer graphs. al- Rafidain Journal of Computer Sciences and Mathematics،Vol. 10, no. 4, pp.71-86.
https://search.emarefa.net/detail/BIM-351204
Modern Language Association (MLA)
Sharaf, Khidr R.& Ali, Didar A.. Nullity and bounds to the nullity of dendrimer graphs. al- Rafidain Journal of Computer Sciences and Mathematics Vol. 10, no. 4 (2013), pp.71-86.
https://search.emarefa.net/detail/BIM-351204
American Medical Association (AMA)
Sharaf, Khidr R.& Ali, Didar A.. Nullity and bounds to the nullity of dendrimer graphs. al- Rafidain Journal of Computer Sciences and Mathematics. 2013. Vol. 10, no. 4, pp.71-86.
https://search.emarefa.net/detail/BIM-351204
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 86
Record ID
BIM-351204
