Login / Signup

The formulas for the number of spanning trees in circulant graphs.

Min LiZhibing ChenXiaoqing RuanXuerong Yong
Published in: Discret. Math. (2015)
Keyphrases
  • spanning tree
  • small number
  • undirected graph
  • minimum spanning trees
  • computational complexity
  • graph theory
  • edge weights
  • random graphs