A new approach for the characteristic polynomial of a complete tripartite graph

Basit Öğe Kaydı
dc.contributor.authorAlwan, Nawras A.
dc.contributor.authorAl-Saidi, Nadia M. G.
dc.contributor.authorAbdulaa, Wael J.
dc.date.accessioned2024-07-12T20:47:15Z
dc.date.available2024-07-12T20:47:15Z
dc.date.issued2021en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractThe case k = 3 of a complete k-partite graph is called a complete tripartite graph Tp,q,r. It is a graph that its vertices are decomposed into three disjoint sets such that, no two graph vertices within the same set are adjacent. It has recently attracted much attention due to its important in several applications, especially, in chemistry where some of the molecular orbital compounds are correspondents to the tripartite graph structure. One method of capturing graph structure is through computing of the characteristic polynomial for the matrix characterization M of a graph, which is defined as the determinant | ?I ? M | where I is the identity matrix and ? is the variable of the polynomial. The general technique of the characteristic polynomials evaluation of graphs with large number of vertices is considered as an extremely tiresome problem when it is based on matrix, because its computational complexity is high. In this paper, a new approach for the characteristic polynomial of a complete tripartite graph Ti,i,n?2i, for n ? 4, based on the adjacency matrix is introduced. It shows good efficiency because it reduces the complexity and the difficulty of computation in comparing to some well-known methods especially, for the graphs with large number of vertices.en_US
dc.identifier.citationAlwan, N. A., Al-Saidi, N. M. G. ve Abdulaa, W. J. (2021). A new approach for the characteristic polynomial of a complete tripartite graph. Fourth International Conference of Mathematical Sciences, Maltepe Üniversitesi. s. 1-4.en_US
dc.identifier.endpage4en_US
dc.identifier.isbn978-0-7354-4078-4
dc.identifier.startpage1en_US
dc.identifier.urihttps://aip.scitation.org/doi/10.1063/5.0042627
dc.identifier.urihttps://hdl.handle.net/20.500.12415/1962
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofFourth International Conference of Mathematical Sciencesen_US
dc.relation.isversionof10.1063/5.0042627en_US
dc.relation.publicationcategoryUluslararası Kitapen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07382
dc.subjectCharacteristic polynomialen_US
dc.subjecttripartite graphen_US
dc.subjectadjacency matrixen_US
dc.titleA new approach for the characteristic polynomial of a complete tripartite graphen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu