Computation of the Complexity of Networks under Generalized Operations

Hafiz Usman Afzal, Muhammad Javaid, Ali Ovais, Md Nur Alam and Miaomiao Wang

Complexity, 2022, vol. 2022, 1-20

Abstract: The connected and acyclic components contained in a network are identified by the computation of its complexity, where complexity of a network refers to the total number of spanning trees present within. The article in hand deals with the enumeration of the complexity of various networks’ operations such as sum (K2,n+W3, K2,n+nK1, Kn+Sn), product (K2,n⊠K2, K2,n  ⋉K2, Kn×K2, Kn⊠K2), difference K2,n⊖K2, and the conjunction of Sn with K2. All our computations have been concluded by implementation of the methods of linear algebra and matrix theory. Our derivations will also be highlighted with the assistance of 3D plots at the end of this article.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2022/6288054.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2022/6288054.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:6288054

DOI: 10.1155/2022/6288054

Access Statistics for this article

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