| 关于图的顶点划分数 |
| |
| 引用本文： | 熊黎明. 关于图的顶点划分数[J]. 江西师范大学学报(自然科学版), 1994, 18(4): 343-346 |
| |
| 作者姓名： | 熊黎明 |
| |
| 作者单位： | 江西师大数学系!南昌330027 |
| |
| 摘 要： | 该文讨论了无爪图的顶点划分数,给出了完全n部图的顶点划分数的计算公式,最后证明了任意图的点线荫度不大于它的边线荫度且不等式是精确的.
|
| 关 键 词： | 顶点划分数 点线荫度 边线荫度 图 |
On the Vertices Partition Numbers of a Graph |
| |
| Xiong Liming. On the Vertices Partition Numbers of a Graph[J]. Journal of Jiangxi Normal University (Natural Sciences Edition), 1994, 18(4): 343-346 |
| |
| Authors: | Xiong Liming |
| |
| Abstract: | :In this paper, the vertex partition number of a claw-free graph is studied, the formula for vertex partition of a complete n-partition graph will be obtained, finally,it is proved that the vertex linear arboricity of a graph is not greater than its edge linear arboricity and the inequality is sharp. |
| |
| Keywords: | :the vertices partition number of a graph the vertice linear arboricity of a graph the edge lin-ear arboricity of a graph complete n-partition graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
