Counting spanning trees in prism and anti-prism graphs
JOURNAL OF APPLIED ANALYSIS AND COMPUTATION(2016)
摘要
In this paper, we calculate the number of spanning trees in prism and antiprism graphs corresponding to the skeleton of a prism and an antiprism. By the electrically equivalent transformations and rules of weighted generating function, we obtain a relationship for the weighted number of spanning trees at the successive two generations. Using the knowledge of difference equations, we derive the analytical expressions for enumeration of spanning trees. In addition, we again calculate the number of spanning trees in Apollonian networks, which shows that this method is simple and effective. Finally we compare the entropy of our networks with other studied networks and find that the entropy of the antiprism graph is larger.
更多查看译文
关键词
Electrically equivalent transformation,spanning trees,prism graph,anti-prism graph
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要