The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems (Q810055)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems |
scientific article; zbMATH DE number 4212095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems |
scientific article; zbMATH DE number 4212095 |
Statements
The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems (English)
0 references
1988
0 references
An hexagonal system is a 2-connected finite plane graph in which each face other than the exterior is bounded by a hexagon. The Z- transformation graph Z(H) of the hexagonal system H has vertices corresponding to the 1-factors of H and two vertices are adjacent if the symmetric difference of their corresponding 1-factors consists of the six edges of a hexagon in H. It is shown that the graph Z(H) has connectivity equal to the minimum degree of a vertex in Z(H).
0 references
hexagonal system
0 references
Z-transformation graph
0 references
1-factors
0 references
0.9647823
0 references
0.93720376
0 references
0.91950667
0 references
0.8901531
0 references
0.88249606
0 references
0.8672373
0 references
0.86507535
0 references
