<?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=49367"><dc:title>The strong isometric dimension of graphs of diameter two</dc:title><dc:creator>Jerebic,	Janja	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>izometrični podgraf</dc:subject><dc:subject>krepki produkt grafov</dc:subject><dc:subject>premer grafa</dc:subject><dc:subject>krepka izometrična dimenzija</dc:subject><dc:subject>Petersenov graf</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>isometric subgraph</dc:subject><dc:subject>strong product of graphs</dc:subject><dc:subject>graph diameter</dc:subject><dc:subject>strong isometric dimension</dc:subject><dc:subject>Petersen graph</dc:subject><dc:subject/><dc:description>Krepka izometrična dimenzija ▫$textrm{idim}(G)$▫ grafa ▫$G$▫ je najmanjše število ▫$k$▫, za katero lahko ▫$G$▫ izometrično vložimo v krepki produkt ▫$k$▫ poti. Problem določitve ▫$textrm{idim}(G)$▫ za grafe premera dva je reduciran na problem pokrivanja komplementa grafa ▫$G$▫ s polnimi dvodelnimi grafi. Za primer je pokazano, da je izometrična dimenzija Petersenovega grafa enaka 5.</dc:description><dc:date>2003</dc:date><dc:date>2015-07-10 11:58:37</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>49367</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
