On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)

DOI10.1016/0012-365X(90)90377-TzbMath0699.05029WikidataQ127124569 ScholiaQ127124569MaRDI QIDQ912860

Mohammed Z. Abu-Sbeih

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complete bipartite graphnumber of labelled spanning trees

Mathematics Subject Classification ID

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

Related Items (2)

On two conjectures concerning spanning tree edge dependences of graphs ⋮ An approach to the performance of SPC product codes on the erasure channel

Cites Work

• On $W$-bases of directed graphs

This page was built for publication: On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)