The number of spanning trees of a graph

被引：0
|
作者：
Kinkar C Das
Ahmet S Cevik
Ismail N Cangul
机构：
[1] Sungkyunkwan University,Department of Mathematics
[2] Faculty of Science,Department of Mathematics
[3] Selçuk University,Department of Mathematics
[4] Faculty of Arts and Science,undefined
[5] Uludag University,undefined
[6] Gorukle Campus,undefined
来源：
Journal of Inequalities and Applications | / 2013卷
关键词：
graph; spanning trees; independence number; clique number; first Zagreb index;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let G be a simple connected graph of order n, m edges, maximum degree Δ1 and minimum degree δ. 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, Δ1 and δ:
引用
收藏
相关论文
共 50 条
12345