Z-transformation graphs of perfect matchings of hexagonal systems (Q1825211)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4120208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Z-transformation graphs of perfect matchings of hexagonal systems |
scientific article; zbMATH DE number 4120208 |
Statements
Z-transformation graphs of perfect matchings of hexagonal systems (English)
0 references
1988
0 references
Given a hexagonal system H, the Z-transformation graph Z(H) is the graph whose vertices are perfect matchings of H. Two vertices are adjacent in Z(H) if the symmetric difference of the corresponding matchings is a hexagon of H. The authors give some properties of this transformation graph: Z(H) is bipartite, connected and is either a path or a graph of girth 4. In addition, they characterize those hexagonal systems whose Z- transformation graphs are not 2-connected.
0 references
hexagonal system
0 references
perfect matchings
0 references
transformation graphs
0 references
0.9465594291687012
0 references
0.9053601026535034
0 references
0.8966094255447388
0 references
