Upper Bounds for the Number of Spanning Trees of Graphs

dc.contributor.authorBozkurt, Ş. Burcu
dc.date.accessioned2020-03-26T18:32:03Z
dc.date.available2020-03-26T18:32:03Z
dc.date.issued2012
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn this paper, we present some upper bounds for the number of spanning trees of graphs in terms of the number of vertices, the number of edges and the vertex degrees.en_US
dc.identifier.citationBozkurt, Ş. B., (2012). Upper Bounds for the Number of Spanning Trees of Graphs. Journal of Inequalities and Applications.
dc.identifier.doi10.1186/1029-242X-2012-269en_US
dc.identifier.issn1029-242Xen_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://dx.doi.org/10.1186/1029-242X-2012-269
dc.identifier.urihttps://hdl.handle.net/20.500.12395/28604
dc.identifier.wosWOS:000317844900002en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorBozkurt, Ş. Burcu
dc.language.isoenen_US
dc.publisherSPRINGER INTERNATIONAL PUBLISHING AGen_US
dc.relation.ispartofJournal of Inequalities and Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectGraphen_US
dc.subjectSpanning Treesen_US
dc.subjectNormalized Laplacian Eigenvaluesen_US
dc.titleUpper Bounds for the Number of Spanning Trees of Graphsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
8604.pdf
Boyut:
162.35 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası