Explicit Formulas for the Complexity of Networks Produced by New Duplicating Corona and Cartesian Product
One important algebraic invariant in networks is complexity. This invariant ensures the accuracy and dependability of the network. In this paper, we employ a combinatorial approach to determine the graph’s complexity. A fundamental set of building blocks (basic graphs) will serve as the foundation f...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2024/9131329 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!