Paper
28 March 2023 Minimum strong radius of the strong product of paths
Shuyang Liu, Feng Li
Author Affiliations +
Proceedings Volume 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022); 1259711 (2023) https://doi.org/10.1117/12.2672193
Event: Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 2022, Nanjing, China
Abstract
D is a strong oriented graph, the strong distance sd(u, v) is the number of arcs of D containing u and v. For a vertex v of D, the strong eccentricity se (v) is the strong distance between v and a vertex farthest from v. The strong radius srad(D) is the minimum strong eccentricity among the vertices of D. The minimum strong radius srad(G) of a graph D is the minimum strong radius over all strong orientations of G. And G1 G2 denote the strong product of graphs G1 and G2 . In this paper, according to the order of paths we give the result of the minimum strong radius of the strong product of paths, and propose a new directed network design method.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shuyang Liu and Feng Li "Minimum strong radius of the strong product of paths", Proc. SPIE 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 1259711 (28 March 2023); https://doi.org/10.1117/12.2672193
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Design and modelling

Network architectures

Picosecond phenomena

Telecommunications

Computer science

Computing systems

Data processing

Back to Top