The Open UniversitySkip to content
 

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

Shim, S.; Zerovnik, J. and Siran, J. (2002). Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discrete Applied Mathematics, 119(3) pp. 281–286.

DOI (Digital Object Identifier) Link: http://doi.org/10.1016/S0166-218X(01)00310-9
Google Scholar: Look up in Google Scholar

Abstract

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

Item Type: Journal Article
ISSN: 0166-218X
Keywords: Routing; Shortest path; Vertex-transitive graph
Academic Unit/Department: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 8098
Depositing User: Jozef Širáň
Date Deposited: 14 Jun 2007
Last Modified: 04 Oct 2016 10:02
URI: http://oro.open.ac.uk/id/eprint/8098
Share this page:

Altmetrics

Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk