| 白羽,强会英.联图Pm∨Cn的邻和可区别边染色[J].井冈山大学自然版,2023,44(6):7-13 |
| 联图Pm∨Cn的邻和可区别边染色 |
| NEIGHBOR SUM DISTINGUISHING EDGE COLORING OF JOIN GRAPHS Pm∨Cn |
| 投稿时间：2023-09-05 修订日期：2023-10-08 |
| DOI：10.3969/j.issn.1674-8085.2023.06.002 |
| 中文关键词: 联图 邻和可区别边染色 邻和可区别边色数 |
| 英文关键词: join graphs neighbor sum distinguishing edge coloring neighbor sum distinguishing edge chromatic number |
| 基金项目:国家自然科学基金项目(61962035) |
|
| 摘要点击次数: 236 |
| 全文下载次数: 333 |
| 中文摘要: |
| 图G的邻和可区别边染色是指图G的一个正常边染色φ,满足图G中的任意一条边UV,点u关联边的颜色数之和异于点V。图G的一个邻和可区别k-边染色中用到的最小颜色数k,称为图G的邻和可区别边色数。本研究运用数学归纳法、分析法研究了联图Pm∨Cn的邻和可区别边染色问题,得到了联图Pm∨Cn的邻和可区别边色数。 |
| 英文摘要: |
| Let φ be a proper edge coloring of graph G, which satisfies the condition that for any edge UV in graph G, the chromatic sum of the edges associated with vertex U is different from vertex V,then φ is the neighbor sum distinguishing edge coloring of graph G. The neighbor sum distinguishing edge chromatic numbers of graph G is the smallest k such that graph G has a neighbor sum distinguishing k-edge coloring. In this paper,the neighbor sum distinguishing edge coloring problem of the join graph Pm ∨ Cn is studied by the methods of analysis and mathematical induction, the neighbor sum distinguishing edge chromatic numbers of the join graph Pm ∨ Cn are obtained. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
