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 trees between the Dürer graphs and transformed graphs. By algebraic calculations, we obtain a closed-form formula for the number of spanning trees with regard to iteration step. Finally we compare the entropy of our graph with other studied graphs and see that its value of entropy lies in the interval of those of graphs with average degree being 3 and 4.
@article{bwmeta1.element.doi-10_1515_math-2017-0136,
author = {Shixing Li},
title = {Enumeration of spanning trees in the sequence of D\"urer graphs},
journal = {Open Mathematics},
volume = {15},
year = {2017},
pages = {1591-1598},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2017-0136}
}
Shixing Li. Enumeration of spanning trees in the sequence of Dürer graphs. Open Mathematics, Tome 15 (2017) pp. 1591-1598. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2017-0136/