Number of spanning Trees in the sequence of some Nonahedral graphs

被引：0
|
作者：
Daoud, S. N. [1 ,2 ]
机构：
[1] Taibah Univ, Fac Sci, Dept Math, Al Madinah 41411, Saudi Arabia
[2] Menoufia Univ, Fac Sci, Dept Math, Shibin Al Kawm 32511, Egypt
来源：
UTILITAS MATHEMATICA | 2020年 / 115卷
关键词：
Spanning trees; Fritsch graph; Electrically equivalent transformations;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A nonahedral graph is a polyhedral graph having nine vertices. In this work, using knowledge of difference equations we drive the explicit formulas for the number of spanning trees in the sequence of some Nonahedral graphs such as Fritsch graph, Tridiminished icosahedron graph and (9,3) - configuration graph 2 by electrically equivalent transformations and rules of weighted generating function. Finally, we compare the entropy of our graphs with other studied graphs with average degree being 4,5 and 6.
引用
收藏
页码：39 / 56
页数：18
相关论文
共 50 条
12345