| 正则图点可区别全色数的一个上界 |
| |
| 引用本文： | 强会英,王洪申.正则图点可区别全色数的一个上界[J].福州大学学报(自然科学版),2016,44(3):311-314. |
| |
| 作者姓名： | 强会英 王洪申 |
| |
| 作者单位： | 兰州交通大学数理学院，甘肃兰州，730070 |
| |
| 基金项目： | 国家自然科学基金项目（61262045） |
| |
| 摘 要： | 图G的一个正常全染色被称作点可区别全染色,如果G中任意两个点的色集合不同,其中每个点的色集合包含该点及其关联边的色.应用概率的方法得到了n个点的k-正则图G的一个点可区别全色数的较小上界.
|
| 关 键 词： | 点可区别全染色，点可区别全色数，k-正则图，Lovász局部引理。 |
| 修稿时间： | 6/5/2014 12:00:00 AM |
The bound of vertex-distinguishing total chromatic number of regular graphs |
| |
| QIANG Huiying and WANG Hongshen.The bound of vertex-distinguishing total chromatic number of regular graphs[J].Journal of Fuzhou University(Natural Science Edition),2016,44(3):311-314. |
| |
| Authors: | QIANG Huiying and WANG Hongshen |
| |
| Institution: | School of Mathematics and Physics,Lanzhou Jiaotong University,Gansu Lanzhou,730070 |
| |
| Abstract: | A proper total coloring of the graph G is called vertex distinguishing total coloring,if any two vertics have different color sets,where the color set of vertex is the set composed of all colors of the vertex and the edges incident to it.In this paper,we obtained the new upper bound of vertex distinguishing total chromatic number of the k-regular graphs with n vertex by using probability method. |
| |
| Keywords: | Vertex Distinguishing Total Coloring Vertex |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
