Use is made of an auxiliary matrix to count trees of complete bipartite graphs. One form of the auxiliary matrix achieves partial diagonalization of the node admittance matrix and a second form of the same matrix completes the enumeration. Extension of the results is shown to be compatible with a known count for trees of complete graphs.
Get full access to this article
View all access options for this article.
References
1.
SeshuS. and ReedM. B.Linear Graphs and Electrical Networks, Reading, Mass.: Addison-Wesley (1961), pp. 156–159.
2.
TrentH. M.‘A note on the enumeration and listing of all possible trees in a connected linear graph’, Proc. Nat. Acad. Sci., 40, 1004–1007 (1954).
3.
FielderD. C.‘A discussion of an auxiliary matrix’, Proc. IEEE, 56, 72–73 (1968).
4.
BusaekerR. G. and SaatyT. L.Finite Graphs and Networks. New York: McGraw-Hill (1965), pp. 55–56.
5.
ibid., 137–138.
6.
KnuthD. E.The Art of Computer Programming, Vol. 1, Reading, Mass.: Addison-Wesley (1968), p. 56.
