Panconnectivity algorithm for Eisenstein-Jacobi networks
The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is said to be panconnected if there are cycles of length l between two nodes u and v, for all l = d(u, v), d(...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2023-10-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410823001189 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|