<?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=87532"><dc:title>Resonance graphs and a binary coding of perfect matchings of outerplane bipartite graphs</dc:title><dc:creator>Brezovnik,	Simon	(Avtor)
	</dc:creator><dc:creator>Tratnik,	Niko	(Avtor)
	</dc:creator><dc:creator>Žigert Pleteršek,	Petra	(Avtor)
	</dc:creator><dc:subject>graph theory</dc:subject><dc:subject>resonance graphs</dc:subject><dc:subject>bipartite graphs</dc:subject><dc:description>The aim of this paper is to investigate resonance graphs of $2$-connected outerplane bipartite graphs, which include various families of molecular graphs. Firstly, we present an algorithm for a binary coding of perfect matchings of these graphs. Further, $2$-connected outerplane bipartite graphs with isomorphic resonance graphs are considered. In particular, it is shown that if two $2$-connected outerplane bipartite graphs are evenly homeomorphic, then its resonance graphs are isomorphic. Moreover, we prove that for any $2$-connected outerplane bipartite graph $G$ there exists a catacondensed even ring systems $H$ such that the resonance graphs of $G$ and $H$ are isomorphic. We conclude with the characterization of $2$-connected outerplane bipartite graphs whose resonance graphs are daisy cubes. </dc:description><dc:date>2023</dc:date><dc:date>2024-03-20 07:52:39</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>87532</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
