TY - JOUR
T1 - Minimum and Maximum Strong Radius of the Strong Product of Cycles
AU - Zhou, Shikun
AU - Li, Feng
N1 - Publisher Copyright:
© (2024), (International Association of Engineers). All rights reserved.
PY - 2024
Y1 - 2024
N2 - In strong oriented networks, the strong radius, defined as the minimum strong distance between any two nodes, significantly affects the efficiency of information transmission. A larger radius indicates a greater distance between nodes in the network, which results in decreased transmission efficiency and increased latency. In practice, optimizing the strong radius enhances network structure, accelerating information transmission and significantly reducing energy consumption and costs linked to long-distance transmission. This optimization is crucial for maintaining an efficient and cost-effective network system. In this paper, we used the strong product approach, employing cycles as factor graphs to construct strong product networks of cycles, and determined their minimum strong radius. Additionally, we established the upper and lower bounds for the maximum strong radius of these networks.
AB - In strong oriented networks, the strong radius, defined as the minimum strong distance between any two nodes, significantly affects the efficiency of information transmission. A larger radius indicates a greater distance between nodes in the network, which results in decreased transmission efficiency and increased latency. In practice, optimizing the strong radius enhances network structure, accelerating information transmission and significantly reducing energy consumption and costs linked to long-distance transmission. This optimization is crucial for maintaining an efficient and cost-effective network system. In this paper, we used the strong product approach, employing cycles as factor graphs to construct strong product networks of cycles, and determined their minimum strong radius. Additionally, we established the upper and lower bounds for the maximum strong radius of these networks.
KW - Cycle
KW - Maximum strong radius
KW - Minimum strong radius
KW - Network
KW - Strong product graph
UR - https://www.scopus.com/pages/publications/85211117674
M3 - 文章
AN - SCOPUS:85211117674
SN - 1819-656X
VL - 51
SP - 1960
EP - 1967
JO - IAENG International Journal of Computer Science
JF - IAENG International Journal of Computer Science
IS - 12
ER -