Name
Abstract | ||
|---|---|---|
We show that the minimum transmitting delay of a given message from a certain sender via two links to all the processors interconnected through a network of a distance-transitive, strongly antipodal graph is 1 + [D/2], where D is the diameter of the graph. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0020-0190(94)00105-7 | Inf. Process. Lett. |
Keywords | Field | DocType |
antipodal graph | Distance-transitive graph,Discrete mathematics,Strength of a graph,Combinatorics,Graph power,Simplex graph,Regular graph,Butterfly graph,Windmill graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
51 | 5 | 0020-0190 |
Citations | PageRank | References |
1 | 0.35 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jung-Sing Jwo | 1 | 357 | 34.18 |
| Tai-Ching Tuan | 2 | 41 | 6.15 |