| 关于几类图的邻点可区别关联色数 |
| |
| 引用本文： | 王文丽,刘西奎,周薇.关于几类图的邻点可区别关联色数[J].山东理工大学学报,2008,22(5):105-107. |
| |
| 作者姓名： | 王文丽 刘西奎 周薇 |
| |
| 作者单位： | 山东科技大学信息科学与工程学院,山东青岛266510 |
| |
| 摘 要： | 邻点可区别关联着色的定义是在关联着色的基础上提出的，是使得相邻顶点的颜色集不同的关联着色。主要研究了几类特殊图的邻点可区别关联色数，包括风车图、齿轮图及在此基础上扩充的图Dm、n，拓展了图着色的领域，便于更好地研究图的结构。
|
| 关 键 词： | 邻点可区别关联着色 风车图 齿轮图 |
The adjacent vertex-distinguishing incidence coloring number of classes graphs |
| |
| WANG Wen-li,LIU Xi-kui,ZHOU Wei.The adjacent vertex-distinguishing incidence coloring number of classes graphs[J].Journal of Shandong University of Technology:Science and Technology,2008,22(5):105-107. |
| |
| Authors: | WANG Wen-li LIU Xi-kui ZHOU Wei |
| |
| Institution: | WANG Wen-li,LIU Xi-kui,ZHOU Wei(College of Information Science , Engineering,Sh,ong University of Science , Technology,Qingdao 266510,China) |
| |
| Abstract: | The adjacent vertex-distinguishing incidence coloring is raised based on the definition of incidence oloring,and incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.We mostly study the adjacent vertex-distingushing incidence coloring number of some special graphs,including the windmill graph,gear graph and Dm,n.It exploits the area of the graph coloring and makes for studying the structure of graphs. |
| |
| Keywords: | adjacent vertex-distinguishing incidence coloring windmill graph gear graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
