IDEAS home Printed from https://ideas.repec.org/a/hin/complx/4271783.html
   My bibliography  Save this article

Number of Spanning Trees in the Sequence of Some Graphs

Author

Listed:
  • Jia-Bao Liu
  • S. N. Daoud

Abstract

In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs. In this work, using knowledge of difference equations, we drive the explicit formulas for the number of spanning trees in the sequence of some graphs generated by a triangle 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.

Suggested Citation

  • Jia-Bao Liu & S. N. Daoud, 2019. "Number of Spanning Trees in the Sequence of Some Graphs," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    • Handle: RePEc:hin:complx:4271783
    DOI: 10.1155/2019/4271783
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2019/4271783.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2019/4271783.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/4271783?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Liu, Jia-Bao & Pan, Xiang-Feng, 2016. "Minimizing Kirchhoff index among graphs with a given vertex bipartiteness," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 84-88.
    2. Liu, Jia-Bao & Pan, Xiang-Feng & Hu, Fu-Tao & Hu, Feng-Feng, 2015. "Asymptotic Laplacian-energy-like invariant of lattices," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 205-214.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Jingyuan & Yan, Weigen, 2020. "Counting spanning trees of a type of generalized Farey graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Praba, B. & Saranya, R., 2020. "Application of the graph cellular automaton in generating languages," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 168(C), pages 111-121.
    2. Faxu Li & Hui Xu & Liang Wei & Defang Wang, 2023. "RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-13, January.
    3. Wenyu Shi & Qiang Tang, 2023. "RETRACTED ARTICLE: Cost-optimized data placement strategy for social network with security awareness in edge-cloud computing environment," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-15, January.
    4. Li Zhang & Jing Zhao & Jia-Bao Liu & Salama Nagy Daoud, 2019. "Resistance Distance in the Double Corona Based on R -Graph," Mathematics, MDPI, vol. 7(1), pages 1-13, January.
    5. Sajjad, Wasim & Sardar, Muhammad Shoaib & Pan, Xiang-Feng, 2024. "Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron," Applied Mathematics and Computation, Elsevier, vol. 461(C).
    6. Huang, Guixian & He, Weihua & Tan, Yuanyao, 2019. "Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 348-357.
    7. Fang Gao & Xiaoxin Li & Kai Zhou & Jia-Bao Liu, 2018. "The Extremal Graphs of Some Topological Indices with Given Vertex k -Partiteness," Mathematics, MDPI, vol. 6(11), pages 1-11, November.
    8. Liu, Jia-Bao & Pan, Xiang-Feng, 2015. "A unified approach to the asymptotic topological indices of various lattices," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 62-73.
    9. Jia Wei & Jing Wang, 2022. "Spectra of Complemented Triangulation Graphs," Mathematics, MDPI, vol. 10(17), pages 1-9, September.
    10. Li Zhang & Jing Zhao & Jia-Bao Liu & Micheal Arockiaraj, 2018. "Resistance Distance in H -Join of Graphs G 1 , G 2 , … , G k," Mathematics, MDPI, vol. 6(12), pages 1-10, November.
    11. Yang, Yujun & Cao, Yuliang & Yao, Haiyuan & Li, Jing, 2018. "Solution to a conjecture on a Nordhaus–Gaddum type result for the Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 241-249.
    12. Liu, Jia-Bao & Pan, Xiang-Feng, 2016. "Minimizing Kirchhoff index among graphs with a given vertex bipartiteness," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 84-88.
    13. Lei, Hui & Li, Tao & Ma, Yuede & Wang, Hua, 2018. "Analyzing lattice networks through substructures," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 297-314.
    14. Jia-Bao Liu & Mobeen Munir & Amina Yousaf & Asim Naseem & Khudaija Ayub, 2019. "Distance and Adjacency Energies of Multi-Level Wheel Networks," Mathematics, MDPI, vol. 7(1), pages 1-9, January.
    15. Das, Kinkar Ch. & Mojallal, Seyed Ahmad, 2016. "Extremal Laplacian energy of threshold graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 267-280.
    16. Jia-Bao Liu & Muhammad Kashif Shafiq & Haidar Ali & Asim Naseem & Nayab Maryam & Syed Sheraz Asghar, 2019. "Topological Indices of m th Chain Silicate Graphs," Mathematics, MDPI, vol. 7(1), pages 1-16, January.
    17. Fei, Junqi & Tu, Jianhua, 2018. "Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 118-124.
    18. Liu, Jia-Bao & Zhao, Jing & Cai, Zheng-Qun, 2020. "On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    19. Guillermo De Ita Luna & Pedro Bello López & Raymundo Marcial-Romero, 2024. "Counting Rules for Computing the Number of Independent Sets of a Grid Graph," Mathematics, MDPI, vol. 12(6), pages 1-14, March.
    20. Jian Lu & Shu-Bo Chen & Jia-Bao Liu & Xiang-Feng Pan & Ying-Jie Ji, 2019. "Further Results on the Resistance-Harary Index of Unicyclic Graphs," Mathematics, MDPI, vol. 7(2), pages 1-13, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:4271783. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.