Login / Signup

On the number of spanning trees in directed circulant graphs.

Zbigniew LoncKrzysztof ParolJacek Wojciechowski
Published in: Networks (2001)
Keyphrases
  • spanning tree
  • small number
  • minimum spanning tree
  • objective function
  • undirected graph
  • edge weights
  • computational complexity
  • special case
  • graph theory