新疆大学学报(自然科学版)

1987, (01) 60

[打印本页] [关闭]
本期目录(Current Issue) | 过刊浏览(Past Issue) | 高级检索(Advanced Search)

Z—Transformation Graphs of perfect Matchings of Hexagonal Systems
Z—Transformation Graphs of perfect Matchings of Hexagonal Systems

张福基 ,郭晓峰 ,陈荣斯

摘要(Abstract):

<正> 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.

关键词(KeyWords):

Abstract:

Keywords:

基金项目(Foundation):

作者(Author): 张福基 ,郭晓峰 ,陈荣斯

Email:

参考文献(References):

扩展功能
本文信息
服务与反馈
本文关键词相关文章
本文作者相关文章
中国知网
分享