| 完全多部图和笛卡儿积图的线性点荫度 |
| |
| 引用本文： | 房勇,吴建良.完全多部图和笛卡儿积图的线性点荫度[J].山东科技大学学报(自然科学版),1999(3). |
| |
| 作者姓名： | 房勇 吴建良 |
| |
| 作者单位： | 山东大学数学院(房勇)，山东矿业学院济南校区(吴建良) |
| |
| 摘 要： | 图的线性点荫度是对它的顶点进行染色所用的最少颜色数，同时使得染同一种颜色的点集所导出的子图，它的每个分支均为路．本文完全确定了完全多部图的线性点荫度，给出了笛卡儿积图的线性点荫度的一个上界，得到了一些特殊图（ 如路，圈和完全图） 的笛卡儿积图的线性点荫度．
|
| 关 键 词： | 图 完全多部图 笛卡儿积图 线性点荫度 |
The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs |
| |
| FANG Yong ,WU Jian liang.The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,1999(3). |
| |
| Authors: | FANG Yong WU Jian liang |
| |
| Institution: | FANG Yong 1,WU Jian liang 2 |
| |
| Abstract: | The vertex linear arboricity of graph G is the least number of colors with which V(G) can be colored such that each subset of vertices received same color induces a subgraph whose connected components are paths. In the paper, we determined the vertex linear arboricity of complete multiple graphs and provided an upper bound for the vertex linear arboricity of Cartesian product graphs. |
| |
| Keywords: | graphs complete multiple graphs Cartesian product graphs the vertex linear arboricity |
| 本文献已被 CNKI 等数据库收录！ |
