Generalized hexagonal systems with each hexagon being resonant (Q1186165): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127814151, #quickstatements; #temporary_batch_1721950759712 |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90205-o / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2051313055 / rank | |||
Normal rank |
Latest revision as of 10:22, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalized hexagonal systems with each hexagon being resonant |
scientific article |
Statements
Generalized hexagonal systems with each hexagon being resonant (English)
0 references
28 June 1992
0 references
A hexagonal system (HS) is a finite 2-connected planar graph in which each interior face is a regular hexagon of side length 1, and a generalized hexagonal system (GHS) is a graph obtained by deleting some interior vertices and interior edges from a HS. An edge of a GHS is said to be not fixed if it belongs to some but not all perfect matchings of the GHS. The main result of the paper is the following: A GHS has no fixed edge if and only if the boundaries of its infinite face and nonhexagon faces are alternating cycles. Moreover, if a GHS has no fixed edge then every face of it is an alternating cycle. Here a cycle is called alternating if it is alternating with respect to some perfect matching.
0 references
hexagonal system
0 references
planar graph
0 references
perfect matchings
0 references
alternating cycles
0 references