Details

Kekulé structure of angularly connected even ring systems
ID Brezovnik, Simon (Author)

.pdfPDF - Presentation file, Download (306,14 KB)
MD5: AA1759EBE32ABA2A4B6C34405B74D30C
URLURL - Source URL, Visit https://www.mdpi.com/2075-1680/13/12/827 This link opens in a new window

Abstract
An even ring system G is a simple 2-connected plane graph with all interior vertices of degree 3, all exterior vertices of either degree 2 or 3, and all finite faces of an even length. G is angularly connected if all of the peripheral segments of G have odd lengths. In this paper, we show that every angularly connected even ring system G, which does not contain any triple of altogether-adjacent peripheral faces, has a perfect matching. This was achieved by finding an appropriate edge coloring of G, derived from the proof of the existence of a proper face 3-coloring of the graph. Additionally, an infinite family of graphs that are face 3-colorable has been identified. When interpreted in the context of the inner dual of G, this leads to the introduction of 3-colorable graphs containing cycles of lengths 4 and 6, which is a supplementation of some already known results. Finally, we have investigated the concept of the Clar structure and Clar set within the aforementioned family of graphs. We found that a Clar set of an angularly connected even ring system cannot in general be obtained by minimizing the cardinality of the set A. This result is in contrast to the previously known case for the subfamily of benzenoid systems, which admit a face 3-coloring. Our results open up avenues for further research into the properties of Clar and Fries sets of angularly connected even ring systems.

Language:English
Keywords:Kekulé structure, Clar structure, perfect matching, benzenoid system, even ring system, face coloring, edge coloring, Clar set
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Publication status:Published
Publication version:Version of Record
Year:2024
Number of pages:14 str.
Numbering:Vol. 13, iss. 12, [art. no.] 827
PID:20.500.12556/RUL-165200 This link opens in a new window
UDC:519.17
ISSN on article:2075-1680
DOI:10.3390/axioms13120827 This link opens in a new window
COBISS.SI-ID:216596995 This link opens in a new window
Publication date in RUL:27.11.2024
Views:68
Downloads:13
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Record is a part of a journal

Title:Axioms
Shortened title:Axioms
Publisher:MDPI
ISSN:2075-1680
COBISS.SI-ID:519951897 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Projects

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARRS - Slovenian Research Agency
Project number:J1-4031
Name:Računalniška knjižnica za zavozlane strukture in aplikacije

Funder:ARRS - Slovenian Research Agency
Project number:J2-2512
Name:Stohastični modeli za logistiko proizvodnih procesov

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back