Abstract
LetH be a hexagonal system. TheZ-transformation graphZ(H) is a graph where the vertices are perfect matchings ofH and where two perfect matchings are joined by an edge provided their synimetric difference consists of six edges of a hexagon ofH. We prove that the connectivity ofZ(H) is equal to the minimum degree of vertices ofZ(H).
Similar content being viewed by others
References
Harary, F., The cell growth problem and its attempted solutions, Beiträge zur Graphentheorie (Int. Koll. Manebach, 9–12. Mai 1967), ed. H. Sachs, H. — J. Voss, and H. Walther. B. G. Teubner Verlagsgesellschaft Leipzig 1968, 49–60.
Zhang Fuji, Chen Rongsi and Guo Xiaofeng, Perfect Matchings in Hexagonal Systems,Graph and Combinatorics,1 (1985), 383–386.
Zhang Fuji, Guo Xiaofeng and Chen Rongsi,Z-transformation graphs of perfect matchings of hexagonal systems, Proceeding of the First Japan International Conference on Graph Theory and Applications.
N. Ohkami, A. Motoyama, T. Yamaguchi, H. Hosoya and I. Gutman, Graph-theoretical analysis of the Clar's aromatic sextet,Tetrahedron,37 (1981), 1113–1122.
Chen Zhibo, Directed tree structure of the set of Kekulé patterns of polyhex graphs,Chemical Physics Letters,115 (1985), 291–293.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Zhang, F., Guo, X. & Chen, R. The connectivity ofZ-transformation graphs of perfect matchings of hexagonal systems. Acta Mathematicae Applicatae Sinica 4, 131–135 (1988). https://doi.org/10.1007/BF02006061
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02006061