| 一类变换图的连通性 |
| |
| 引用本文： | 王迪吉.一类变换图的连通性[J].数学研究,1996,29(2):76-80. |
| |
| 作者姓名： | 王迪吉 |
| |
| 作者单位： | 新疆师范大学数学系 |
| |
| 摘 要： | 本文定义了一类由给定的一个３－正则平面偶图的全体完美匹配所构成的变换图，并证明了该变换图是连通的．由此可得出结论：从任一给定的３－正则平面偶图的完美匹配出发，通过一种所谓的旋转运算，就可以生成全部其它的完美匹配．
|
| 关 键 词： | 3－正则平面偶图，变换图，旋转运算 |
The Connectivity of a Class of Transformation Graphs |
| |
| Wang Diji.The Connectivity of a Class of Transformation Graphs[J].Journal of Mathematical Study,1996,29(2):76-80. |
| |
| Authors: | Wang Diji |
| |
| Abstract: | A type of transformation graph defined on the perfect matchings of a given 3--regular Planar bipartitegraph is introduce in this Paper,and it is shown that these transformation graphs are connected. Hence we conclude that from any given perfect matching of a 3-regular planar bipartite graph we can get all other perfect matchings of it by using a kind of so called Z-transformation. |
| |
| Keywords: | regular planar bipartite graph Interchange graph Z-transformation |
| 本文献已被 CNKI 维普 等数据库收录！ |
