Treffer: Computation of the Complexity of Networks under Generalized Operations
Title:
Computation of the Complexity of Networks under Generalized Operations
Authors:
Source:
Complexity, Vol 2022 (2022)
Publisher Information:
Wiley, 2022.
Publication Year:
2022
Subject Terms:
Physics, Graph Spectra and Topological Indices, 0211 other engineering and technologies, Statistical and Nonlinear Physics, QA75.5-76.95, 02 engineering and technology, Complexity Classification, Physics and Astronomy, Computational Theory and Mathematics, Combinatorics, Electronic computers. Computer science, Physical Sciences, Computer Science, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Statistical Mechanics of Complex Networks, Geometry and Topology, Networks, Mathematics, Network Analysis, Graph Theory and Algorithms, Parameterized Complexity
Document Type:
Fachzeitschrift
Article<br />Other literature type
File Description:
text/xhtml
Language:
English
ISSN:
1099-0526
1076-2787
1076-2787
DOI:
10.1155/2022/6288054
DOI:
10.60692/ahjb8-say98
DOI:
10.60692/q7xdk-12r25
Rights:
CC BY
Accession Number:
edsair.doi.dedup.....b4a8b146e79b9aad7332c1ac398f81df
Database:
OpenAIRE
Weitere Informationen
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.