Published January 1, 2013
| Version v1
Journal article
Open
The number of spanning trees of a graph
- 1. Sungkyunkwan Univ, Dept Math, Suwon 440746, South Korea
- 2. Selcuk Univ, Fac Sci, Dept Math, TR-42075 Campus, Konya, Turkey
- 3. Uludag Univ, Fac Arts & Sci, Dept Math, TR-16059 Bursa, Turkey
Description
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:
Files
bib-5c886544-a866-43f8-b2cd-a8c199d75679.txt
Files
(122 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:57c075d6a322f3692669ef80aaaca846
|
122 Bytes | Preview Download |