Login / Signup

An efficient approach for counting the number of spanning trees in circulant and related graphs.

Talip AtajanXuerong YongHiroshi Inaba
Published in: Discret. Math. (2010)
Keyphrases
  • spanning tree
  • small number
  • undirected graph
  • minimum spanning trees
  • graph theory
  • special case
  • maximum number
  • graph theoretic
  • edge disjoint
  • directed graph
  • minimum spanning tree
  • minimum weight
  • root node