<?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=51674"><dc:title>Connectivity of Cartesian products of graphs</dc:title><dc:creator>Špacapan,	Simon	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>kartezični produkt grafov</dc:subject><dc:subject>povezanost</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>Cartesian product</dc:subject><dc:subject>connectivity</dc:subject><dc:subject/><dc:description>Naj bo ▫$kappa(G)$▫ povezanost grafa ▫$G$▫ in ▫$G Box H$▫ kartezični produkt grafov ▫$G$▫ in ▫$H$▫. Dokažemo, da je za poljubna netrivialna ▫$G$▫ in ▫$H$▫, ▫$kappa(G Box H) = min{kappa(G)|H|, kappa(H)|G|, delta(G Box H)}$▫.</dc:description><dc:date>2008</dc:date><dc:date>2015-07-10 15:02:23</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51674</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
