The connectivity ofZ-transformation graphs of perfect matchings of hexagonal systems
Copyright policy )The connectivity ofZ-transformation graphs of perfect matchings of hexagonal systems
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).
- Minjiang University China (People's Republic of)
- Xinjiang University China (People's Republic of)
- Fuzhou University China (People's Republic of)
Connectivity, 1-factors, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Z-transformation graph, hexagonal system
Connectivity, 1-factors, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Z-transformation graph, hexagonal system
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).21 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!