<?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=51510"><dc:title>On the weak reconstruction of strong product graphs</dc:title><dc:creator>Zmazek,	Blaž	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>problem rekonstrukcije</dc:subject><dc:subject>šibka rekonstrukcija</dc:subject><dc:subject>krepki produkt grafov</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>reconstruction problem</dc:subject><dc:subject>strong product</dc:subject><dc:subject>composite graphs</dc:subject><dc:subject/><dc:description>We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.</dc:description><dc:date>2003</dc:date><dc:date>2015-07-10 14:52:43</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>51510</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>