Complexity of Products of Some Complete and Complete Bipartite Graphs
Keyword(s):
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.
2014 ◽
Vol 2014
◽
pp. 1-23
◽
2013 ◽
Vol 2013
◽
pp. 1-11
◽
Keyword(s):
2014 ◽
Vol Vol. 16 no. 1
(Analysis of Algorithms)
◽
2021 ◽
Vol 10
(4)
◽
pp. 2115-2129
2012 ◽
Vol 9
(4)
◽
pp. 584-592
◽
2013 ◽
Vol 2013
◽
pp. 1-4
◽
2019 ◽
Vol 10
(6)
◽
pp. 1332-1340