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:	https://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 Item
ISSN:	0166-218X
Keywords:	Routing; Shortest path; Vertex-transitive graph
Academic Unit/School:	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

Actions (login may be required)

RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationRefMan RIS Format (UTF-8)OpenURL ContextObjectEndNoteMODSOpenURL ContextObject in SpanMPEG-21 DIDLEP3 XMLRefMan RIS FormatRDF+N3