Complexity of Some Generalized Operations on Networks
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/9999157 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|