Login / Signup

The number of spanning trees in circulant graphs.

Yuanping ZhangXuerong YongMordecai J. Golin
Published in: Discret. Math. (2000)
Keyphrases
  • spanning tree
  • maximum number
  • minimum cost
  • undirected graph
  • small number
  • random walk
  • minimum spanning trees
  • data sets
  • neural network
  • special case
  • graph matching
  • graph model