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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2020-09-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844020316297 |