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 条
  • [31] The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs
    Stavros D. Nikolopoulos
    Charis Papadopoulos
    Graphs and Combinatorics, 2004, 20 : 383 - 397
  • [32] The number of spanning trees in a superprism
    Bogdanowicz, Zbigniew R.
    DISCRETE MATHEMATICS LETTERS, 2024, 13 : 66 - 73
  • [33] The number of spanning trees of a graph
    Kinkar C Das
    Ahmet S Cevik
    Ismail N Cangul
    Journal of Inequalities and Applications, 2013
  • [34] The number of spanning trees in Kn-Complements of quasi-threshold graphs
    Nikolopoulos, SD
    Papadopoulos, C
    GRAPHS AND COMBINATORICS, 2004, 20 (03) : 383 - 397
  • [35] The number of spanning trees of a graph
    Li, Jianxi
    Shiu, Wai Chee
    Chang, An
    APPLIED MATHEMATICS LETTERS, 2010, 23 (03) : 286 - 290
  • [36] The number of spanning trees of a graph
    Das, Kinkar C.
    Cevik, Ahmet S.
    Cangul, Ismail N.
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013,
  • [37] EMBEDDING SPANNING TREES IN RANDOM GRAPHS
    Krivelevich, Michael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) : 1495 - 1500
  • [38] A note on universal graphs for spanning trees
    Gyori, Ervin
    Li, Binlong
    Salia, Nika
    Tompkins, Casey
    DISCRETE APPLIED MATHEMATICS, 2025, 362 : 146 - 147
  • [39] Spanning Trees of Dense Directed Graphs
    Mycroft, Richard
    Naia, Tassio
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 645 - 654
  • [40] The number of spanning trees in Apollonian networks
    Zhang, Zhongzhi
    Wu, Bin
    Comellas, Francesc
    DISCRETE APPLIED MATHEMATICS, 2014, 169 : 206 - 213
12345