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

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 fa...

Descripción completa

Detalles Bibliográficos
Autores principales: Daoud, S.N., Saleh, Wedad
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2020
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7490826/
https://www.ncbi.nlm.nih.gov/pubmed/32964151
http://dx.doi.org/10.1016/j.heliyon.2020.e04786
Descripción
Sumario: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.

Ejemplares similares