首页 | 本学科首页   官方微博 | 高级检索  
     检索      

THE CONNECTIVITY OF Z-TRANSFORMATION GRAPHS OF PERFECT MATCHINGS OF HEXAGONAL SYSTEMS
作者姓名:张福基  郭晓峰  陈容思
作者单位:Xinjiang University,Xinjiang University,College of Finance and Economics,Fuzhou University
基金项目:Project supported by the National Natural Science Foundation of China
摘    要: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).

本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号