Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

Authors:
Sangho Shim;Jozef Širáň;Janez Žerovnik
Affiliations:
Department of Mathematics, Pohang University of Science and Technology, Pohang 790-784, South Korea;Department of Mathematics, Slovak University of Technology, SvF, Radlinskeho, 11, 813 68 Bratislava, Slovakia;IMFM/DTCS, Jadranska 19, Ljubljana and FME, University of Maribor, Maribor, Slovenia
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 4
Cited 0

The forwarding index of communication networks

IEEE Transactions on Information Theory
On forwarding indices of networks

Discrete Applied Mathematics
Vertex-transitive graphs that are not Cayley graphs. II

Journal of Graph Theory
On quasi-Cayley graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this note we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an infinite family of counterexamples.