KMS Of Academy of mathematics and systems sciences, CAS
| ondefectedcolouringsofgraphs | |
| Yao Bing1; Zhang Zhongfu1; Wang Jianfang2 | |
| 2013 | |
| 发表期刊 | actamathematicaeapplicataesinica
 |
| ISSN | 0168-9673 |
| 卷号 | 29期号:4页码:777 |
| 摘要 | A k-edge-coloring f of a connected graph G is a (lambda(1), lambda(2), ... , lambda(beta))-defected k-edge-coloring if there is a smallest integer beta with 1 = 2, and each color of {beta + 1, beta + 2, ... , k} appears at some vertices at most one time. The (lambda(1), lambda(2), ... , lambda(beta))-defected chromatic index of G, denoted as chi'(lambda(1), lambda(2), ... , lambda(beta);G), is the smallest number such that every (lambda(1), lambda(2), ... , lambda(beta))-defected t-edge-coloring of G holds t >= chi'(lambda(1), lambda(2), ... , lambda(beta); G). We obtain Delta(G) <= chi'(lambda(1), lambda(2), ... , lambda(beta); G) + Sigma(beta)(i=1)(lambda(i) - 1) <= Delta(G) + 1, and introduce two new chromatic indices of G as: the vertex pan-biuniform chromatic index x(pb)' (G), and the neighbour vertex pan-biuniform, chromatic index chi(npb)'(G), and furthermore find the structure of a tree T having chi(pb)'(T) = 1. |
| 语种 | 英语 |
| 资助项目 | [National Natural Science Foundation of China] |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/43472 |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.西北师范大学 2.中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Yao Bing,Zhang Zhongfu,Wang Jianfang. ondefectedcolouringsofgraphs[J]. actamathematicaeapplicataesinica,2013,29(4):777. |
| APA | Yao Bing,Zhang Zhongfu,&Wang Jianfang.(2013).ondefectedcolouringsofgraphs.actamathematicaeapplicataesinica,29(4),777. |
| MLA | Yao Bing,et al."ondefectedcolouringsofgraphs".actamathematicaeapplicataesinica 29.4(2013):777. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论