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

DOI10.1109/TCS.1976.1084242zbMATH Open0335.05122MaRDI QIDQ4101856FDOQ4101856

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)

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

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)