A General formula for characteristic polynomials of some special graphs
Joint Authors
Ulwan, Nawras A.
al-Saidi, Nadiyah Muhammad Ghanim Jawhar
Source
Engineering and Technology Journal
Issue
Vol. 34, Issue 5B (31 May. 2016), pp.638-650, 13 p.
Publisher
Publication Date
2016-05-31
Country of Publication
Iraq
No. of Pages
13
Main Subjects
Information Technology and Computer Science
Abstract EN
The calculation of characteristic polynomials (Ch.
Poly.) of graphs of any size, especially for the large number of vertices n is an extremely tedious problem if used the traditional methods, so in this paper, the general formulas of the characteristic polynomial of some graphs, such as, path, complete, circle and star graphs are introduced.
It is constructed based on adjacency and Laplacian matrices.
The efficiency of the proposed method is demonstrated in terms of complexity to show an improvement over traditional methods
American Psychological Association (APA)
Ulwan, Nawras A.& al-Saidi, Nadiyah Muhammad Ghanim Jawhar. 2016. A General formula for characteristic polynomials of some special graphs. Engineering and Technology Journal،Vol. 34, no. 5B, pp.638-650.
https://search.emarefa.net/detail/BIM-783765
Modern Language Association (MLA)
Ulwan, Nawras A.& al-Saidi, Nadiyah Muhammad Ghanim Jawhar. A General formula for characteristic polynomials of some special graphs. Engineering and Technology Journal Vol. 34, no. 5B (2016), pp.638-650.
https://search.emarefa.net/detail/BIM-783765
American Medical Association (AMA)
Ulwan, Nawras A.& al-Saidi, Nadiyah Muhammad Ghanim Jawhar. A General formula for characteristic polynomials of some special graphs. Engineering and Technology Journal. 2016. Vol. 34, no. 5B, pp.638-650.
https://search.emarefa.net/detail/BIM-783765
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 649-650
Record ID
BIM-783765