Number of Spanning Trees of Different Products of Complete and Complete Bipartite Graphs

S. N. Daoud
2014 Mathematical Problems in Engineering  
Spanning trees have been found to be structures of paramount importance in both theoretical and practical problems. In this paper we derive new formulas for the complexity, number of spanning trees, of some products of complete and complete bipartite graphs such as Cartesian product, normal product, composition product, tensor product, symmetric product, and strong sum, using linear algebra and matrix theory techniques.
doi:10.1155/2014/965105 fatcat:lns6huzdunfgdogc5k2cfxs4ma