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 条
  • [1] Enumerating the Number of Spanning Trees of Pyramid Graphs Based on Some Nonahedral Graphs
    Asiri, Ahmad
    Daoud, Salama Nagy
    AXIOMS, 2025, 14 (03)
  • [2] Complexity trees of the sequence of some nonahedral graphs generated by triangle
    Daoud, S. N.
    Saleh, Wedad
    HELIYON, 2020, 6 (09)
  • [3] THE NUMBER OF SPANNING TREES IN SOME CLASSES OF GRAPHS
    Haghighi, M. H. Shirdareh
    Bibak, Kh.
    ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2012, 42 (04) : 1183 - 1195
  • [4] Upper bounds for the number of spanning trees of graphs
    Bozkurt, S. Burcu
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2012,
  • [5] Upper bounds for the number of spanning trees of graphs
    Ş Burcu Bozkurt
    Journal of Inequalities and Applications, 2012
  • [6] The asymptotic number of spanning trees in circulant graphs
    Golin, Mordecai J.
    Yong, Xuerong
    Zhang, Yuanping
    DISCRETE MATHEMATICS, 2010, 310 (04) : 792 - 803
  • [7] On the number of spanning trees in graphs with multiple edges
    Sahbani, Hajar
    El Marraki, Mohamed
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 55 (1-2) : 245 - 255
  • [8] On the number of spanning trees of Knm ± G graphs
    Nikolopoulos, Stavros D.
    Papadopoulos, Charis
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2006, 8 (01): : 235 - 248
  • [9] On the number of spanning trees in random regular graphs
    Greenhill, Catherine
    Kwan, Matthew
    Wind, David
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
  • [10] On the number of spanning trees in directed circulant graphs
    Lonc, Z
    Parol, K
    Wojciechowski, JM
    NETWORKS, 2001, 37 (03) : 129 - 133
12345