Premium
A note on the number of spanning trees in buckminsterfullerene
Author(s) -
Trinajstić Nenad,
Mihalić Zlatko,
Harris Frank E.
Publication year - 1994
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.560520846
Subject(s) - buckminsterfullerene , spanning tree , combinatorics , mathematics , physics , fullerene , quantum mechanics
A “pedestrian” approach is used to enumerate the spanning trees in buckminsterfullerene. The approach is called “pedestrian” because calculations were carried out by hand and pocket calculator. The number of spanning trees obtained for buckminsterfullerene is 375,291,866,372,898,816,000, a number identical to the value reported by Brown et al. [J. Comput. Chem. 12 , 1118 (1991)] who used a computationally more involved approach. © 1994 John Wiley & Sons, Inc.