Number of Spanning Trees in the Sequence of Some Graphs
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/4271783 |
| id |
doaj-7113e35fa9a042a6b77071f72b010482 |
|---|---|
| record_format |
Article |
| spelling |
doaj-7113e35fa9a042a6b77071f72b0104822020-11-25T01:55:59ZengHindawi-WileyComplexity1076-27871099-05262019-01-01201910.1155/2019/42717834271783Number of Spanning Trees in the Sequence of Some GraphsJia-Bao Liu0S. N. Daoud1School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, ChinaDepartment of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El Kom 32511, EgyptIn 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.http://dx.doi.org/10.1155/2019/4271783 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Jia-Bao Liu S. N. Daoud |
| spellingShingle |
Jia-Bao Liu S. N. Daoud Number of Spanning Trees in the Sequence of Some Graphs Complexity |
| author_facet |
Jia-Bao Liu S. N. Daoud |
| author_sort |
Jia-Bao Liu |
| title |
Number of Spanning Trees in the Sequence of Some Graphs |
| title_short |
Number of Spanning Trees in the Sequence of Some Graphs |
| title_full |
Number of Spanning Trees in the Sequence of Some Graphs |
| title_fullStr |
Number of Spanning Trees in the Sequence of Some Graphs |
| title_full_unstemmed |
Number of Spanning Trees in the Sequence of Some Graphs |
| title_sort |
number of spanning trees in the sequence of some graphs |
| publisher |
Hindawi-Wiley |
| series |
Complexity |
| issn |
1076-2787 1099-0526 |
| publishDate |
2019-01-01 |
| description |
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. |
| url |
http://dx.doi.org/10.1155/2019/4271783 |
| work_keys_str_mv |
AT jiabaoliu numberofspanningtreesinthesequenceofsomegraphs AT sndaoud numberofspanningtreesinthesequenceofsomegraphs |
| _version_ |
1724982341754945536 |