<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=51449"><dc:title>A counterexample to the uniform shortest path routing conjecture for vertex-transitive graphs</dc:title><dc:creator>Širáň,	Jozef	(Avtor)
	</dc:creator><dc:creator>Shim,	Sangho	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>po vozliščih prehodni grafi</dc:subject><dc:subject>najkrajše poti</dc:subject><dc:subject>krepki produkt</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>vertex-transitive graphs</dc:subject><dc:subject>shortest paths</dc:subject><dc:subject>strong product</dc:subject><dc:subject/><dc:date>2000</dc:date><dc:date>2015-07-10 14:47:18</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51449</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>