<?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=51601"><dc:title>Cancellation properties of products of graphs</dc:title><dc:creator>Imrich,	Wilfried	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Rall,	Douglas F.	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>produkti grafov</dc:subject><dc:subject>pravilo krajšanja</dc:subject><dc:subject>enoličnost korenov</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>graph products</dc:subject><dc:subject>cancellation property</dc:subject><dc:subject>uniqueness of roots</dc:subject><dc:subject/><dc:description>V tem kratkem prispevku razširimo rezultate Fernándeza, Leightona in López-Presa o enoličnosti ▫$r$▫-tih korenov nepovezanih grafov glede na kartezični produkt na druge produkte in pokažemo, da lahko z njihovimi metodami izpeljemo nova pravila krajšanja.</dc:description><dc:date>2007</dc:date><dc:date>2015-07-10 14:58:50</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51601</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>