dc.contributor.author | Ahmed, Hanan | en_US |
dc.contributor.author | Alwardi, Anwar | en_US |
dc.contributor.author | Salestina M., Ruby | en_US |
dc.date.accessioned | 2023-01-04T15:03:27Z | |
dc.date.available | 2023-01-04T15:03:27Z | |
dc.date.issued | 2023-01 | |
dc.identifier.citation | Ahmed, H., Alwardi, A. & Salestina M., R. (2023). On the vertex degree polynomial of graphs. TWMS Journal Of Applied And Engineering Mathematics, 13(1), 232-245. | en_US |
dc.identifier.issn | 2146-1147 | en_US |
dc.identifier.issn | 2587-1013 | en_US |
dc.identifier.uri | http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5217 | |
dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/current/118-vol13no1/959 | |
dc.description.abstract | A novel graph polynomial, termed as vertex degree polynomial, has been conceptualized, and its discriminating power has been investigated regarding its coefficients and the coefficients of its derivatives and their relations with the physical and chemical properties of molecules. Correlation coefficients ranging from 95% to 98% were obtained using the coefficients of the first and second derivatives of this new polynomial. We also show the relations between this new graph polynomial, and two oldest Zagreb indices, namely the first and second Zagreb indices. We calculate the vertex degree polynomial along with its roots for some important families of graphs like tadpole graph, windmill graph, firefly graph, Sierpinski sieve graph and Kragujevac trees. Finally, we use the vertex degree polynomial to calculate the first and second Zagreb indices for the Dyck-56 network and also for the chemical compound triangular benzenoid G[r]. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Işık University Press | en_US |
dc.relation.ispartof | TWMS Journal Of Applied And Engineering Mathematics | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Vertex degree polynomial | en_US |
dc.subject | Vertex degree roots | en_US |
dc.subject | First Zagreb index | en_US |
dc.subject | Second Zagreb index | en_US |
dc.subject | Kragujevac tree | en_US |
dc.title | On the vertex degree polynomial of graphs | en_US |
dc.type | Article | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.volume | 13 | |
dc.identifier.issue | 1 | |
dc.identifier.startpage | 232 | |
dc.identifier.endpage | 245 | |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |
dc.indekslendigikaynak | Emerging Sources Citation Index (ESCI) | en_US |
dc.indekslendigikaynak | MathScinet | en_US |
dc.indekslendigikaynak | Scopus | en_US |