<?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=51515"><dc:title>On the role of hypercubes in the resonance graphs of benzenoid graphs</dc:title><dc:creator>Salem,	Khaled	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Gutman,	Ivan	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>benzenoidni graf</dc:subject><dc:subject>popolno prirejanje</dc:subject><dc:subject>resonančni graf</dc:subject><dc:subject>hiperkocka</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>benzenoid graph</dc:subject><dc:subject>perfect matching</dc:subject><dc:subject>resonance graph</dc:subject><dc:subject>hypercube</dc:subject><dc:subject/><dc:description>The resonance graph ▫$R(B)$▫ of a benzenoid graph ▫$B$▫ has the perfect matchings of ▫$B$▫ as vertices, two perfect matchings being adjacent if their symmetric difference forms the edge set of a hexagon of ▫$B$▫. A family ▫$mathscr{P}$▫ of pair-wise disjoint hexagons of a benzenoid graph ▫$B$▫ is resonant in ▫$B$▫ if ▫$B -- mathscr{P}$▫ contains at least one perfect matching, or if ▫$B -- mathscr{P}$▫ is empty. It is proven that there exists a surjective map ▫$f$▫ from the set of hypercubes of ▫$R(B)$▫ onto the resonant sets of B such that a ▫$k$▫-dimensional hypercube is mapped into a resonant set of cardinality ▫$k$▫.</dc:description><dc:date>2006</dc:date><dc:date>2015-07-10 14:53:13</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>51515</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
