@inproceedings{27c22846df0341eaa3425e9270127810,
title = "Minimum Strong Radius of the Strong Product of Paths",
abstract = "Let 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.",
keywords = "Strong oriented graph, minimum strong radius, path, strong distance, strong product",
author = "Shuyang Liu and Feng Li",
note = "Publisher Copyright: {\textcopyright} 2023 SPIE.; 2nd International Conference on Statistics, Applied Mathematics, and Computing Science, CSAMCS 2022 ; Conference date: 25-11-2022 Through 27-11-2022",
year = "2023",
doi = "10.1117/12.2672193",
language = "英语",
series = "Proceedings of SPIE - The International Society for Optical Engineering",
publisher = "SPIE",
editor = "Wanyang Dai and Shi Jin",
booktitle = "Second International Conference on Statistics, Applied Mathematics, and Computing Science, CSAMCS 2022",
}