Counting Spanning Trees in The Ladders

Gujun Wang

School of Mathematical Sciences, Jiangsu University, China.

Min Xiao

School of Mathematical Sciences, Jiangsu University, China.

Feng Zhu *

School of Mathematical Sciences, Jiangsu University, China.

*Author to whom correspondence should be addressed.


Abstract

Aims: In order to study the rule of entropy in different graph transformations, this paper introduces and further generalizes the ladder graph from different perspectives, including pinwheel ladders and 3-dimensional ladders. Then the problem of entropy comes down to the calculation of spanning trees in these graphs.

Place and Duration of Study: School of Mathematical Sciences, Jiangsu University, between January 2023 and October 2023. 

Methodology: A method by seeking similar terms was generalized to help study the essential principle in these graphs. By similarity diagonalization and computer aided calculation, the exact expressions for the number of spanning trees in these graphs are obtained.

Keywords: Spanning tree, recursive system of equations, family of Ladders, pinwheel ladders, 3-dimensional ladders, entropy


How to Cite

Wang, Gujun, Min Xiao, and Feng Zhu. 2023. “Counting Spanning Trees in The Ladders”. Asian Research Journal of Mathematics 19 (11):142-58. https://doi.org/10.9734/arjom/2023/v19i11761.

Downloads

Download data is not yet available.