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://dx.doi.org/doi: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:	Mathematics, Computing and Technology > Mathematics and Statistics
Item ID:	8098
Depositing User:	Jozef Siran
Date Deposited:	14 Jun 2007
Last Modified:	02 Dec 2010 20:00
URI:	http://oro.open.ac.uk/id/eprint/8098

Actions (login may be required)

	View Item
RDF+XMLBibTeXRDF+N-TriplesJSONDublin CoreAtomOAI-ORE Resource Map (Atom Format)Simple MetadataReferMETSOAI-ORE Resource Map (RDF Format)HTML CitationASCII CitationMultiline CSVRefMan RIS Format (UTF-8)OpenURL ContextObjectEndNoteMODSOpenURL ContextObject in SpanMPEG-21 DIDLEP3 XMLRefMan RIS FormatRDF+N3Eprints Application Profile	Public: Report issue / request change