Show simple item record

dc.contributor.authorZhang, F. J.zh_CN
dc.contributor.authorGuo, X. F.zh_CN
dc.contributor.authorChen, R. S.zh_CN
dc.contributor.author郭晓峰zh_CN
dc.date.accessioned2013-12-12T02:28:20Z
dc.date.available2013-12-12T02:28:20Z
dc.date.issued1988zh_CN
dc.identifier.citationDiscrete Mathematics,72(1-3):405-415zh_CN
dc.identifier.issn0012-365Xzh_CN
dc.identifier.otherISI:A1988Q949900047zh_CN
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/66754
dc.description.abstractLet H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the vertices are the perfect matchings of H and where two perfect matchings are joined by an edge provided their symmetric difference is a hexagon of H. We prove that Z(H) is a connected bipartite graph if H has at least one perfect matching. Furthermore,Z(H) is either an elementary chain or graph with girth 4; and Z(H) - Vm is 2-connected, where Vm is the set of monovalency vertices in Z(H). Finally, we give those hexagonal systems whose Z-transformation graphs are not 2-connected.zh_CN
dc.language.isoen_USzh_CN
dc.titleZ-TRANSFORMATION GRAPHS OF PERFECT MATCHINGS OF HEXAGONAL SYSTEMSzh_CN
dc.typeArticlezh_CN


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record