Counting the spanning trees of a labelled molecular-graph

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 whos...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Molecular physics 1983-11, Vol.50 (4), p.859-877
Hauptverfasser:	Gutman, I., Mallion, R.B., Essam, J.W.
Format:	Artikel
Sprache:	eng
Schlagworte:	Atomic and molecular physics Calculations and mathematical techniques in atomic and molecular physics (excluding electron correlation calculations) Electronic structure of atoms, molecules and their ions: theory Exact sciences and technology Physics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0026-8976 1362-3028
DOI:	10.1080/00268978300102731