Complexity trees of the sequence of some nonahedral graphs generated by triangle

被引：3
|
作者：
Daoud, S. N. [1 ,2 ]
Saleh, Wedad [1 ]
机构：
[1] Taibah Univ, Dept Math, Fac Sci, Al Madinah 41411, Saudi Arabia
[2] Menoufia Univ, Fac Sci, Dept Math & Comp Sci, Shibin Al Kawm 32511, Egypt
来源：
HELIYON | 2020年 / 6卷 / 09期
关键词：
Mathematics; Number of spanning trees; Entropy; Electrically equivalent transformations; COUNTING SPANNING-TREES; NUMBER; PRODUCTS;
D O I：
10.1016/j.heliyon.2020.e04786
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Calculating the number of spanning trees of a graph is one of the widely studied graph problems since the Pioneer Gustav Kirchhoff (1847). 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 (nine faced polyhedral) graphs generated by triangle using electrically equivalent transformations and rules of the weighted generating function. Finally, we evaluate the entropy of graphs in this manuscript with different studied graphs with an average degree being 4, 5 and 6.
引用
收藏
页数：17
相关论文
共 15 条
  • [1] Number of spanning Trees in the sequence of some Nonahedral graphs
    Daoud, S. N.
    UTILITAS MATHEMATICA, 2020, 115 : 39 - 56
  • [2] Enumerating the Number of Spanning Trees of Pyramid Graphs Based on Some Nonahedral Graphs
    Asiri, Ahmad
    Daoud, Salama Nagy
    AXIOMS, 2025, 14 (03)
  • [3] Number of spanning trees of some families of graphs generated by a triangle
    Daoud, S. N.
    JOURNAL OF TAIBAH UNIVERSITY FOR SCIENCE, 2019, 13 (01): : 731 - 739
  • [4] Complexity of Some Graphs Generated by Ladder Graph
    Daoud, S. N.
    Elsonbaty, A.
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2013, 36 (06): : 87 - 94
  • [5] Enumeration of spanning trees in the sequence of Durer graphs
    Li, Shixing
    OPEN MATHEMATICS, 2017, 15 : 1591 - 1598
  • [6] Counting spanning trees on fractal graphs and their asymptotic complexity
    Anema, Jason A.
    Tsougkas, Konstantinos
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2016, 49 (35)
  • [7] Complexity of Products of Some Complete and Complete Bipartite Graphs
    Daoud, S. N.
    JOURNAL OF APPLIED MATHEMATICS, 2013,
  • [8] Complexity of Some Special named Graphs and Chebyshev polynomials
    Daoud, S. N.
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2013, 32 (02): : 77 - 84
  • [9] Complexity of some special named graphs with double edges
    Daoud, Salama N.
    Mohamed, Kamel A.
    JOURNAL OF TAIBAH UNIVERSITY FOR SCIENCE, 2014, 8 (02): : 162 - 174
  • [10] Number of Spanning Trees of Some Circulant Graphs and Their Asymptotic Behavior
    Elsonbaty, A.
    Daoud, S. N.
    Al-Ahmady, H.
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2012, 30 (06): : 93 - 102
12