THE CONNECTIVITY OF Z-TRANSFORMATION GRAPHS OF PERFECT MATCHINGS OF HEXAGONAL SYSTEMS

被引：5
|
作者：
张福基
郭晓峰
陈容思
机构：
[1] College of Finance and Economics
[2] Xinjiang University
[3] Fuzhou University
来源：
Acta Mathematicae Applicatae Sinica(English Series) | 1988年 / 02期
基金：
中国国家自然科学基金;
关键词：
门刀; THE CONNECTIVITY OF Z-TRANSFORMATION GRAPHS OF PERFECT MATCHINGS OF HEXAGONAL SYSTEMS;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let H be a hexagonal system.The Z-transformation graph Z(H) is a graph where the vertices are perfect matchings of H and where two perfect matchings are joined by an edge provided their symmetric difference consists of six edges of a hexagon of H. We prove that the connectivity of Z(H) is equal to the minimum degree of vertices of Z(H).
引用
收藏
页码：131 / 135
页数：5
相关论文
共 50 条
12345