|
|||||
|
|
| 图Sm∨Wn(m,n≥3)的第一类弱全色数 | |
| 引用本文： | 杨随义,包世堂,杨晓亚,文飞.图Sm∨Wn(m,n≥3)的第一类弱全色数[J].甘肃科学学报,2011,23(2):5-9. |
| 作者姓名： | 杨随义 包世堂 杨晓亚 文飞 |
| 作者单位： | 1. 天水师范学院数学与统计学院,甘肃天水,741001 2. 兰州城市学院信息工程学院,甘肃兰州,730070 3. 兰州交通大学应用数学研究所,甘肃兰州,730070 |
| 摘 要： | 图的第一类弱全染色是相邻点染不同色且相邻边染不同色的全染色,所用的最少颜色数称为第一类弱全色数.运用构造第一类弱全染色法给出了星与轮联图的第一类弱全色数. |
| 关 键 词： | 联图 第一类弱全染色 第一类弱全色数 |
On the First Kind of Weak Total Coloring of Graphs Sm∨Wn |
|
| YANG Sui-yi,BAO Shi-tang,YANG Xiao-ya,WEN Fei.On the First Kind of Weak Total Coloring of Graphs Sm∨Wn[J].Journal of Gansu Sciences,2011,23(2):5-9. | |
| Authors: | YANG Sui-yi BAO Shi-tang YANG Xiao-ya WEN Fei |
| Institution: | 1.Department of Mathematics,Tianshui Normal College,Tianshui 741001,China; 2.Informational Engineering Institute,Lanzhou City University,Lanzhou 730070,China; 3.Institute of Applied Mathematics,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| Abstract: | The first kind of weak total coloring of graphs is a total coloring such that two adjacent vertices and two adjacent edges are not assigned the same colors.The minimum number of colors is called the first kind of weak total chromatic number.The first kind of weak total coloring chromatic number of Sm∨Wn(m,n≥3) is discussed in the paper. |
| Keywords: | joint graph the first kind of weak total coloring the first kind of weak total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |