Basit öğe kaydını göster

dc.contributor.authorAhmed, Hananen_US
dc.contributor.authorAlwardi, Anwaren_US
dc.contributor.authorSalestina M., Rubyen_US
dc.date.accessioned2023-01-04T15:03:27Z
dc.date.available2023-01-04T15:03:27Z
dc.date.issued2023-01
dc.identifier.citationAhmed, 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.issn2146-1147
dc.identifier.issn2587-1013
dc.identifier.urihttps://hdl.handle.net/11729/5217
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/current/118-vol13no1/959
dc.description.abstractA 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.isoengen_US
dc.publisherIşık University Pressen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectVertex degree polynomialen_US
dc.subjectVertex degree rootsen_US
dc.subjectFirst Zagreb indexen_US
dc.subjectSecond Zagreb indexen_US
dc.subjectKragujevac treeen_US
dc.titleOn the vertex degree polynomial of graphsen_US
dc.typearticleen_US
dc.description.versionPublisher's Versionen_US
dc.relation.journalTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.identifier.volume13
dc.identifier.issue1
dc.identifier.startpage232
dc.identifier.endpage245
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US
dc.relation.indexEmerging Sources Citation Index (ESCI)en_US
dc.relation.indexMathScineten_US
dc.relation.indexScopusen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess