The number of spanning trees of a graph

Das K. C., ÇEVİK A. S., CANGÜL İ. N.

JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası:
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1186/1029-242x-2013-395
  • Dergi Adı: JOURNAL OF INEQUALITIES AND APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Anahtar Kelimeler: graph, spanning trees, independence number, clique number, first Zagreb index, MOLECULAR-ORBITALS, ZAGREB INDEXES
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

Let G be a simple connected graph of order n, m edges, maximum degree Delta(1) and minimum degree delta. Li et al. (Appl. Math. Lett. 23: 286-290, 2010) gave an upper bound on number of spanning trees of a graph in terms of n, m, Delta(1) and delta: