排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
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). 相似文献
1