The number of spanning trees in a network determines the totality of acyclic and connected components present within. This number is termed as complexity of the network. In this article, we address the closed formulae of the complexity of networks’ operations such as duplication (split, shadow, and vortex networks of
S
n
), sum (
S
n
+
W
3
,
S
n
+
K
2
, and
C
n
∘
K
2
+
K
1
), product (
S
n
⊠
K
2
and
W
n
∘
K
2
), semitotal networks (
Q
S
n
and
R
S
n
), and edge subdivision of the wheel. All our findings in this article have been obtained by applying the methods from linear algebra, matrix theory, and Chebyshev polynomials. Our results shall also be summarized with the help of individual plots and relative comparison at the end of this article.
Parallel algorithms for finding connected components using linear algebra