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

DOI10.1016/S0166-218X(01)00310-9zbMath1019.90013WikidataQ123136890 ScholiaQ123136890MaRDI QIDQ1613354

Janez Žerovnik, Jozef Širáň, Sang Ho Shim

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

shortest pathroutingvertex-transitive graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (3)

On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ \(r\)-regular families of graph automorphisms ⋮ Cayley graphs on left quasi-groups and groupoids representing \(k\)-generalised Petersen graphs

Cites Work

• On quasi-Cayley graphs
• On forwarding indices of networks
• The forwarding index of communication networks
• Forwarding indices of consistent routings and their complexity
• Vertex-transitive graphs that are not Cayley graphs. II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs