Login / Signup

Counting the number of spanning trees in a class of double fixed-step loop networks.

Talip AtajanNaohisa OtsukaXuerong Yong
Published in: Appl. Math. Lett. (2010)
Keyphrases
  • spanning tree
  • fixed number
  • small number
  • computational complexity
  • finite number
  • multiple classes
  • social networks
  • special case