The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems (Q810055): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems |
scientific article |
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
