| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Resonance graphs and a binary coding of perfect matchings of outerplane bipartite graphs
Authors:ID Brezovnik, Simon (Author)
ID Tratnik, Niko (Author)
ID Žigert Pleteršek, Petra (Author)
Files:.pdf RAZ_Brezovnik_Simon_2023.pdf (427,03 KB)
MD5: F8668E5249DE697D36C83AB26FF789AF
 
URL http://dx.doi.org/10.46793/match.90-2.453B
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract: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.
Keywords:graph theory, resonance graphs, bipartite graphs
Publication status:Published
Publication version:Version of Record
Article acceptance date:13.02.2023
Publication date:24.04.2023
Year of publishing:2023
Number of pages:str. 453-468
Numbering:Letn. 90, št. 2
PID:20.500.12556/DKUM-87532 New window
UDC:519.17
ISSN on article:0340-6253
COBISS.SI-ID:150211587 New window
DOI:10.46793/match.90-2.453B New window
Publication date in DKUM:10.12.2024
Views:171
Downloads:24
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Match : communications in mathematical and in computer chemistry
Shortened title:Match
Publisher:University of Kragujevac, Faculty of Science
ISSN:0340-6253
COBISS.SI-ID:2624551 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Funding programme:Raziskovalni program
Project number:P1-0297
Name:Teorija grafov

Funder:ARRS - Slovenian Research Agency
Funding programme:Bilateral project
Project number:NK-0001
Name:Nove okolju sprejemljive tankoplastne prevleke mešanic korozijskih inhibitorjev: njihov mehanizem in uporaba

Funder:ARRS - Slovenian Research Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Secondary language

Language:Slovenian
Keywords:teorija grafov, resonančni grafi, bipartitni grafi


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica