|
|||||
|
|
| Petersen图的Hamilton性和边色数 | |
| 引用本文： | 张忠辅,李敬文,刘林忠,王建方.Petersen图的Hamilton性和边色数[J].经济数学,2000,17(2):42-44. |
| 作者姓名： | 张忠辅 李敬文 刘林忠 王建方 |
| 作者单位： | 1. 兰州铁道学院应用数学研究所,兰州 730070 2. 兰州铁道学院电信系,兰州,730070 3. 兰州铁道学院应用数学研究所,兰州,730070 4. 中国科学院应用数学研究所,北京,100080 |
| 基金项目： | This Research are supported by NNSFC(No.19871036) |
| 摘 要： | 对简单图G(V,E),定义图G的关联图I(G)为V(I(G))={(ve)|v∈V(G)且e∈E(G)和v与e关联},E(I(G))={(ue,vf)Iu=v或e=f或uv=e或uv=f}.本文证明了Petersen图可被分解为边不交的Hamilton-圈和一个1-因子的并. |
| 关 键 词： | Petersen图 关联图 Hamilton-性 边色数. |
| 修稿时间： | 1999年8月16日 |
ON THE HAMILTON-PROPERTY AND EDGE CHROMATIC NUMBER OF INCIDENCE CRAPH OF PETERSEN GRAPH |
|
| Zhang Zhongfu,Li Jingwen,Liu Linzhong,Wang Jianfang.ON THE HAMILTON-PROPERTY AND EDGE CHROMATIC NUMBER OF INCIDENCE CRAPH OF PETERSEN GRAPH[J].Mathematics in Economics,2000,17(2):42-44. | |
| Authors: | Zhang Zhongfu Li Jingwen Liu Linzhong Wang Jianfang |
| Abstract: | For a graph G( V, E), we define the incidence graph I(G) of G is such a graph which V(I(G)) ={(ve)|v ∈ V(G) ande ∈ E(G) and v incident toe}, E(I(G) ) = {(ue, vf)|u = vore = f or uv = e or uv = f}. In this paper, we proved that the incidence graph of Petersen graph can be classified into a union of edge-disjoint Hamilton cycles and one 1-factor. |
| Keywords: | Petersen graph incidence graph Hamilton-properties edge coloring chromatic |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |