| 若干n重积图的点可区别边色数 |
| |
| 引用本文： | 田双亮. 若干n重积图的点可区别边色数[J]. 西北民族学院学报, 2005, 26(2): 1-3 |
| |
| 作者姓名： | 田双亮 |
| |
| 作者单位： | 西北民族大学计算机科学与信息工程学院 甘肃兰州730030 |
| |
| 摘 要： | 通过研究若干n重积图的边色数及点可区别边色数,就可证明■(Gi)=△(Gi),i=1,2,L,n,则∑=′×××=■△(G_i)其中G1×G2×L×Gn为G1,G2,L,Gn的n重积图.
|
| 关 键 词： | 积图 边色数 点可区别边色数 |
| 文章编号： | 1009-2102(2005)02-0001-03 |
| 修稿时间： | 2005-02-28 |
The Vertex-Distingquishing Edge Chromatic Number of Some n-Multiple Product Graphs |
| |
| TIAN Shuang-liang. The Vertex-Distingquishing Edge Chromatic Number of Some n-Multiple Product Graphs[J]. Journal of Northwest Minorities University(Natural Science ), 2005, 26(2): 1-3 |
| |
| Authors: | TIAN Shuang-liang |
| |
| Abstract: | The edge chromatic number and the vertex-distinguishing edge chromatic number of some product graphs were studied in this paper. It has been proven that if χ ′vd ( Gi )=?(Gi),i=1,2,L,n, then ∑=′ ×××=n?ivd GGGnGi1χ ( 1 2L)() Where G 1 × G2×L×Gn is the n -multiple product of graphs G1 , G2,L ,Gn. |
| |
| Keywords: | product graph edge chromatic number vertex-distinguishing edge chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
