%0 Journal Article %1 gutman83 %A Gutman, I. %A Mallion, R.B. %A Essam, J.W. %D 1983 %J Molecular Physics %K chemistry eigenvalues graph.theory matrix.tree.theorem %N 4 %P 859--877 %R 10.1080/00268978300102731 %T Counting the spanning trees of a labelled molecular-graph %V 50 %X 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.

@article{gutman83, 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. }, added-at = {2017-01-19T12:49:54.000+0100}, author = {Gutman, I. and Mallion, R.B. and Essam, J.W.}, biburl = {https://www.bibsonomy.org/bibtex/26b7ac92f5b90083a036456f8c725c803/ytyoun}, description = {Counting the spanning trees of a labelled molecular-graph: Molecular Physics: Vol 50, No 4}, doi = {10.1080/00268978300102731}, interhash = {e4a4d59f4ee43bb8789ba1a08ed35ad6}, intrahash = {6b7ac92f5b90083a036456f8c725c803}, journal = {Molecular Physics}, keywords = {chemistry eigenvalues graph.theory matrix.tree.theorem}, number = 4, pages = {859--877}, timestamp = {2017-02-01T04:32:23.000+0100}, title = {Counting the spanning trees of a labelled molecular-graph}, volume = 50, year = 1983 }