| 广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界 |
| |
| 引用本文： | 李沐春,强会英,张忠辅. 广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界[J]. 大学数学, 2009, 25(2) |
| |
| 作者姓名： | 李沐春 强会英 张忠辅 |
| |
| 作者单位： | 兰州交通大学,数理与软件工程学院,甘肃,兰州,730070;兰州交通大学,数理与软件工程学院,甘肃,兰州,730070;兰州交通大学,数理与软件工程学院,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金，甘肃省教育厅科研基金 |
| |
| 摘 要： | 对简单图G,|V(G)|=p,n是自然数,Mn(G)被称为图G的广义Mycielski图,如果V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…;vn1,vn2,…,vnp},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n-1}.文中针对简单图G与它的广义Mycielski图之间的关系,给出了G的广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界.
|
| 关 键 词： | 广义Mycielski图 邻强边色数 邻点可区别全色数 |
Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs |
| |
| LI Mu-chun,QIANG Hui-ying,ZHANG Zhong-fu. Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs[J]. College Mathematics, 2009, 25(2) |
| |
| Authors: | LI Mu-chun QIANG Hui-ying ZHANG Zhong-fu |
| |
| Affiliation: | Institute of Applied Mathematics;Lanzhou Jiaotong University;Lanzhou 730070;China |
| |
| Abstract: | Mn(G) is called general Mycielski Graph G with |V(G)|=p,n is natural number,ifV(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…;vn1,vn2,…,vnp},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n-1}.This paper focuses on the relation between the basic graph G and it's general Mycielski graph,two bounds of adjacent strong edge chromatic number and adjacent vertex distinguishing total chromatic nubmer of graph Mn(G) are given. |
| |
| Keywords: | general Mycielski graph adjacent-strong-edge coloring adjacent-vertex-distinguishing total coloring |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
