Complexity of Some Special named Graphs and Chebyshev polynomials

被引：0
作者：
Daoud, S. N. [1 ]
机构：
[1] El Minufiya Univ, Fac Sci, Dept Math, Shibin Al Kawm, Egypt
来源：
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS | 2013年 / 32卷 / 02期
关键词：
Number of spanning trees; Ladder; Fan; Wheel; Prism; Moebius ladders; Chebyshev polynomials;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The number of spanning trees tau(G) in graphs (networks) is an important invariant. Some important relations for expanding some special determinants using Chybechiev polynomials of the first kind and second kind are obtained. A large number of theorems of number of the spanning trees(its complexity), of Ladders, fans, wheels, prisms and Moebius ladders are proved.
引用
收藏
页码：77 / 84
页数：8
相关论文
共 50 条
12345