Z—Transformation Graphs of perfect Matchings of Hexagonal Systems |
| |
引用本文: | 张福基
,郭晓峰
,陈荣斯.Z—Transformation Graphs of perfect Matchings of Hexagonal Systems[J].新疆大学学报(理工版),1987(1). |
| |
作者姓名: | 张福基 郭晓峰 陈荣斯 |
| |
摘 要: | A hexagonal system is defined to be a finit connected plane graph with no cut-vertices in which every interior region is surrounded by a regular hexagon of side length one.In the present paper we define the Z-transformation graph of a hexagonal system H to be the graph where vertices are the perfect matchings of (?) and where two perfect matchings are joint by an edge provided their symmetric difference is a hexagon of H.We prove that,if H has perfect matchings,Z(H)is a connected bipartite graph.Besides,Z(H)is either an elementary chain or a graph with girth 4.Some further results are obtained also.
|
本文献已被 CNKI 等数据库收录! |
|