| Autor: |
S.N. Daoud, Wedad Saleh |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
Heliyon, Vol 6, Iss 9, Pp e04786- (2020) |
| Druh dokumentu: |
article |
| ISSN: |
2405-8440 |
| DOI: |
10.1016/j.heliyon.2020.e04786 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
