General solution to the spanning tree enumeration problem in arbitrary multigraph joins
From MaRDI portal
Publication:4101856
DOI10.1109/TCS.1976.1084242zbMath0335.05122MaRDI QIDQ4101856
Publication date: 1976
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Related Items (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