The strong distance problem on the Cartesian product of graphs

Juan, Justie Su-Tzu; Huang, Chun-Ming; Sun, I-Fan

doi:10.1016/j.ipl.2008.01.001

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2008

2024

Publication Types

Select...

Article4

Other2

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 6 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Taiwan scholars and domestic scholars also gave strong distances for many special graphs. E.g pyramid n PN , two types of extended hypercube graphs n EC and n FC [5] ,…”

Section: Introductionmentioning

confidence: 99%

Minimum strong radius of the strong product of paths

Liu

Li²

2023

Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022)

View full text Add to dashboard Cite

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 G1G2 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.

show abstract

“…In addition, Taiwan scholars and domestic scholars also gave strong distances for many special graphs. E.g pyramid n PN , two types of extended hypercube graphs n EC and n FC [5] ,…”

Section: Introductionmentioning

confidence: 99%