For uniform commutative initial edge states in CTQW on the line graph, the weighted spanning tree count tn(G, 1/m) equals tn(G) divided by m to the power n-1.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Schur States, Average Mixing, and Counting Trees on Line Graphs' CTQW
For uniform commutative initial edge states in CTQW on the line graph, the weighted spanning tree count tn(G, 1/m) equals tn(G) divided by m to the power n-1.