Number of Spanning Trees in the Sequence of Some Graphs

Jia-Bao Liu and S. N. Daoud

Complexity, 2019, vol. 2019, 1-22

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.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/4271783.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/4271783.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:4271783

DOI: 10.1155/2019/4271783

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().