Login / Signup

Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs.

Jernej Azarija
Published in: Discuss. Math. Graph Theory (2013)
Keyphrases
  • cartesian product
  • spanning tree
  • lower bound
  • upper bound
  • minimum spanning trees
  • computational complexity
  • undirected graph
  • minimum spanning tree
  • edge disjoint