Number of Spanning Trees in the Sequence of Some Graphs
Joint Authors
Source
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-22, 22 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-03-12
Country of Publication
Egypt
No. of Pages
22
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Liu, Jia-Bao& Daoud, S. N.. 2019. Number of Spanning Trees in the Sequence of Some Graphs. Complexity،Vol. 2019, no. 2019, pp.1-22.
https://search.emarefa.net/detail/BIM-1131763
Modern Language Association (MLA)
Liu, Jia-Bao& Daoud, S. N.. Number of Spanning Trees in the Sequence of Some Graphs. Complexity No. 2019 (2019), pp.1-22.
https://search.emarefa.net/detail/BIM-1131763
American Medical Association (AMA)
Liu, Jia-Bao& Daoud, S. N.. Number of Spanning Trees in the Sequence of Some Graphs. Complexity. 2019. Vol. 2019, no. 2019, pp.1-22.
https://search.emarefa.net/detail/BIM-1131763
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1131763
