Andrej Taranenko (Author), Aleksander Vesel (Author)

Abstract

As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs with Kekulé structures (1-factors). A bipartite graph ▫$G$▫ is called elementary if ▫$G$▫ is connected and every edge belongs to a 1-factor of ▫$G$▫. Some properties of the minimal and the maximal 1-factor of a plane elementary graph are given. A peripheral face ▫$f$▫ of a plane elementary graph is reducible, if the removal of the internal vertices and edges of the path that is the intersection of ▫$f$▫ and the outer cycle of ▫$G$▫ results in an elementary graph. We characterize the reducible faces of a plane elementary bipartite graph. This result generalizes the characterization of reducible faces of an elementary benzenoid graph.

Keywords

matematika;teorija grafov;elementarni dvodelni graf;reducibilno lice;benzenoidni graf;mathematics;graph theory;plane elementary bipartite graph;reducible face;benzenoid graph;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UM FNM - Faculty of Natural Sciences and Mathematics
UDC: 519.17
COBISS: 19104264 Link will open in a new window
ISSN: 1234-3099
Views: 677
Downloads: 329
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Slovenian
Secondary keywords: matematika;teorija grafov;elementarni dvodelni graf;reducibilno lice;benzenoidni graf;
URN: URN:SI:UM:
Type (COBISS): Scientific work
Pages: str. 289-297
Volume: ǂVol. ǂ32
Issue: ǂno. ǂ2
Chronology: 2012
DOI: 10.7151/dmgt.1607
ID: 9595929