On the Number of Spanning Trees of Graphs

Basit Öğe Kaydı
dc.contributor.authorBozkurt, S. Burcu
dc.contributor.authorBozkurt, Durmus
dc.date.accessioned2020-03-26T18:51:52Z
dc.date.available2020-03-26T18:51:52Z
dc.date.issued2014
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractWe establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Delta(1)), minimum vertex degree (delta), first Zagreb index (M-1), and Randic index (R-1).en_US
dc.description.sponsorshipTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK); Office of Selcuk University Research Project (BAP)Selcuk Universityen_US
dc.description.sponsorshipThe authors are partially supported by TUBITAK and the Office of Selcuk University Research Project (BAP).en_US
dc.identifier.doi10.1155/2014/294038en_US
dc.identifier.issn1537-744Xen_US
dc.identifier.pmid24688378en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://dx.doi.org/10.1155/2014/294038
dc.identifier.urihttps://hdl.handle.net/20.500.12395/31040
dc.identifier.wosWOS:000331823300001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakPubMeden_US
dc.language.isoenen_US
dc.publisherHINDAWI PUBLISHING CORPORATIONen_US
dc.relation.ispartofSCIENTIFIC WORLD JOURNALen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.titleOn the Number of Spanning Trees of Graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
PubMed İndeksli Yayın Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu