Login / Signup

Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes.

T. J. N. BrownRoger B. MallionPaul PollakArnd Roth
Published in: Discret. Appl. Math. (1997)
Keyphrases
  • spanning tree
  • edge disjoint
  • graph matching
  • significant improvement
  • computational cost
  • benchmark datasets
  • high throughput