The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems (Q810055): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Fu Ji Zhang / rank
 
Normal rank
Property / author
 
Property / author: Rong Si Chen / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: R. E. L. Aldred / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Z-transformation graphs of perfect matchings of hexagonal systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02006061 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081799004 / rank
 
Normal rank

Latest revision as of 08:24, 30 July 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
    0 references
    0 references
    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

    Identifiers