Complexity of Products of Some Complete and Complete Bipartite Graphs

Abstract EN

The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network.

In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete and complete bipartite graphs such as cartesian product, normal product, composition product, tensor product, and symmetric product, using linear algebra and matrix analysis techniques.