The number of spanning trees of a graph


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

JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013 (Journal Indexed in SCI) identifier identifier identifier

  • Publication Type: Article / Article
  • Volume:
  • Publication Date: 2013
  • Doi Number: 10.1186/1029-242x-2013-395
  • Title of Journal : JOURNAL OF INEQUALITIES AND APPLICATIONS
  • Keywords: graph, spanning trees, independence number, clique number, first Zagreb index, MOLECULAR-ORBITALS, ZAGREB INDEXES

Abstract

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: