| 缩图与扩图 |
| |
| 引用本文： | 高孝忠.缩图与扩图[J].六盘水师范高等专科学校学报,2005,17(3):1-3. |
| |
| 作者姓名： | 高孝忠 |
| |
| 作者单位： | 六盘水师范高等专科学校数学系,贵州,水城,553004 |
| |
| 摘 要： | 在图的研究中,要用数学归纳法证明图的属性,就必须知道n阶图与n+1阶图的关系。删边并点的收缩运算在树的讨论中起到很大的作用。对于运算的逆,则称之为“扩”。文中对多边形、极大平面图,采用不同的“缩”与“扩”,证明了极大平面图是4-面可着色。
|
| 关 键 词： | 缩图 扩图 多边形 拓多边形 极大平面图 |
| 文章编号： | 1671-055X(2005)03-0001-03 |
| 修稿时间： | 2005年3月10日 |
Contracted Graph and Enlarged Graph |
| |
| GAO Xiao-zhong.Contracted Graph and Enlarged Graph[J].Journal of Liupanshui Teachers College,2005,17(3):1-3. |
| |
| Authors: | GAO Xiao-zhong |
| |
| Abstract: | In the study of graph ,to use the mathematics inductive method proof the property of graph ,we need to know the relation of the n order graph and the n+1 order graph .The operation of lose the side and the constringency do play a important role in the discussion of tree .The against of the operation is called "enlarged ".Text adopt the different "contracted "and "enlarged "on the polygon and the maxinal plane graph ,proof the maximal plane graph is 4-apply color. |
| |
| Keywords: | contracted graph enlarged graph polygon enlarged polygon maximal plane graph Hamilton graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
