Login / Signup

Undirected simple connected graphs with minimum number of spanning trees.

Zbigniew R. Bogdanowicz
Published in: Discret. Math. (2009)
Keyphrases
  • spanning tree
  • undirected graph
  • small number
  • connected graphs
  • minimum cost
  • real time
  • edge disjoint
  • neural network
  • image processing
  • computational complexity
  • pairwise
  • fixed number
  • maximum number
  • minimum spanning tree