Enumeration of spanning trees in the sequence of Dürer graphs
In this paper, we calculate the number of spanning trees in the sequence of Dürer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs and further derive relationships for spanning...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-12-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2017-0136 |