Complexity of Some Generalized Operations on Networks

Muhammad Javaid, Hafiz Usman Afzal, Shaohui Wang and M. De Aguiar

Complexity, 2021, vol. 2021, 1-29

Abstract: 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 Sn), sum (Sn+W3, Sn+K2, and Cn∘K2+K1), product (Sn⊠K2 and Wn∘K2), semitotal networks (QSn and RSn), 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/9999157.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/9999157.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9999157

DOI: 10.1155/2021/9999157

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().