Sciweavers

2 search results - page 1 / 1
» Counting Spanning Trees and Other Structures in Non-constant...
Sort
View
50
Voted
ISAAC
2004
Springer
92views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
WG
2004
Springer
15 years 2 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung