| 无K4-子式图的2-距离和可区别边染色 |
| |
| 引用本文： | 强会英,姚丽.无K4-子式图的2-距离和可区别边染色[J].山东大学学报(理学版),2021,56(11):83-86. |
| |
| 作者姓名： | 强会英 姚丽 |
| |
| 作者单位： | 兰州交通大学数理学院, 甘肃 兰州 730070 |
| |
| 基金项目： | 国家自然科学基金资助项目(61962035) |
| |
| 摘 要： | 图G的一个正常边染色φ若满足:∠u,v∈V(G),且dG(u,v)≤2都有f(u)≠f(v),其中f(u)=∑uw∈E(G)φ(uw),则称φ为图G的2-距离和可区别边染色。运用反证法,结合构造染色函数法,研究了无K4-子式图的2-距离和可区别边染色,确定了无K4-子式图的2-距离和可区别边色数的一个上界。
|
| 关 键 词： | 2-距离和可区别边染色 2-距离和可区别边色数 无K4-子式图 |
2-distance sum distinguishing edge coloring of K4-minor-free graphs |
| |
| QIANG Hui-ying,YAO Li.2-distance sum distinguishing edge coloring of K4-minor-free graphs[J].Journal of Shandong University,2021,56(11):83-86. |
| |
| Authors: | QIANG Hui-ying YAO Li |
| |
| Institution: | School of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China |
| |
| Abstract: | Let φ be a proper edge coloring of graph G, for any u,v∈V(G), if dG(u,v)≤2 such that f(u)≠f(v) where f(u)=∑uw∈E(G)φ(uw), then φ is the 2-distance sum distinguishing edge coloring of graph G. The 2-distance sum distinguishing edge coloring of K4-minor-free graphs are studied by using the methods of contradiction and constructing coloring function, and a upper bound of the 2-distance sum distinguishing edge chromatic number of K4-minor-free graphs is obtained. |
| |
| Keywords: | 2-distance sum distinguishing edge coloring 2-distance sum distinguishing edge chromatic K4-minor-free graphs |
|
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
|
