Counting spanning trees of (1, N)-periodic graphs

2023/06/12 by Zhang, Jingyuan, Lu, Fuliang, Jin, Xian'an
#FOS: Physical sciences #Mathematical Physics (math-ph)

paper · doi:10.48550/arxiv.2306.06859

Abstract

Let N≥ 2 be an integer, a (1, N)-periodic graph G is a periodic graph whose vertices can be partitioned into two sets V₁=\v|σ(v)=v\ and V₂=\v|σⁱ(v)≠ v for any 1<i></i>

Related

• Formulas counting spanning trees in line graphs and their extensions
• The spanning tree spectrum: improved bounds and simple proofs
• Crossing numbers of periodic graphs
• Counting graphs with different numbers of spanning trees through the counting of prime partitions
• Counting Spanning Trees of Threshold Graphs