20.500.12556/DKUM-87532 Resonance graphs and a binary coding of perfect matchings of outerplane bipartite graphs 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. graph theory resonance graphs bipartite graphs teorija grafov resonančni grafi bipartitni grafi true false true Angleški jezik Slovenski jezik Znanstveno delo 2024-03-20 07:52:39 2024-12-10 08:43:50 2024-12-11 03:10:48 0000-00-00 00:00:00 2023 0 0 str. 453-468 št. 2 Letn. 90 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 2023-02-13 2023-04-24 519.17 150211587 10.46793/match.90-2.453B 0340-6253 RAZ_Brezovnik_Simon_2023.pdf RAZ_Brezovnik_Simon_2023.pdf 1 F8668E5249DE697D36C83AB26FF789AF 5b6647f099f9e07e6d516c407bb60ef2a15b77b454fc0f624a2e53b33dd83393 6a013663-b6ca-11ef-9a40-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=187217 http://dx.doi.org/10.46793/match.90-2.453B 1 725318ee-e686-11ee-9087-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=177110 Fakulteta za naravoslovje in matematiko 0 0 0