Counting the spanning trees of a labelled molecular-graph
- 1 November 1983
- journal article
- research article
- Published by Taylor & Francis in Molecular Physics
- Vol. 50 (4), 859-877
- https://doi.org/10.1080/00268978300102731
Abstract
A new and simpler method is proposed for counting the spanning trees of a labelled molecular-graph. Its application involves finding the characteristic polynomials (or generalized characteristic polynomials) of certain graphs (the inner duals) related to, but substantially smaller than, the one whose spanning trees are being enumerated.Keywords
This publication has 29 references indexed in Scilit:
- Calculated magnetic properties of some isomers of pyracyleneThe Journal of Organic Chemistry, 1981
- Ring current theories in nuclear magnetic resonanceProgress in Nuclear Magnetic Resonance Spectroscopy, 1979
- General rules for constructing Hueckel molecular orbital characteristic polynomialsJournal of the American Chemical Society, 1976
- General solution to the spanning tree enumeration problem in arbitrary multigraph joinsIEEE Transactions on Circuits and Systems, 1976
- On the question of paramagnetic "ring currents" in pyracylene and related moleculesJournal of the American Chemical Society, 1976
- Some graph-theoretical aspects of simple ring current calculations on conjugated systemsProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1975
- Perturbed [12]annulenes. Synthesis of pyracylenesJournal of the American Chemical Society, 1971
- Notes on the secular determinant in molecular orbital theoryMathematical Proceedings of the Cambridge Philosophical Society, 1950
- The dissection of equilateral triangles into equilateral trianglesMathematical Proceedings of the Cambridge Philosophical Society, 1948
- Ueber eine der Interpolation entsprechende Darstellung der Eliminations-Resultante.Journal für die reine und angewandte Mathematik (Crelles Journal), 1860