General solution to the spanning tree enumeration problem in arbitrary multigraph joins

DOI10.1109/TCS.1976.1084242MaRDI QIDQ4101856zbMATH OpenFDO

Authors Derek A. Waller

Publication date 1976

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cited in

(2)

• Special functions of circuits and systems
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes

This page was built for publication: General solution to the spanning tree enumeration problem in arbitrary multigraph joins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101856)