| 路与圈图的联图的均匀强边染色 |
| |
| 引用本文： | 王涛,刘明菊,李德明.路与圈图的联图的均匀强边染色[J].数学研究及应用,2012,32(1):11-18. |
| |
| 作者姓名： | 王涛 刘明菊 李德明 |
| |
| 作者单位： | 华北科技学院基础部, 河北 三河 065201;北京航空航天大学数学系, 北京 100083;首都师范大学数学系, 北京 100048 |
| |
| 基金项目： | 中央高校基本科研业务费资助(Grant No.2011B019),国家自然科学基金(Grant Nos.10971144;11101020; 11171026),北京市自然科学基金(Grant No.1102015). |
| |
| 摘 要： | For a proper edge coloring c of a graph G,if the sets of colors of adjacent vertices are distinct,the edge coloring c is called an adjacent strong edge coloring of G.Let c i be the number of edges colored by i.If |c i c j | ≤ 1 for any two colors i and j,then c is an equitable edge coloring of G.The coloring c is an equitable adjacent strong edge coloring of G if it is both adjacent strong edge coloring and equitable edge coloring.The least number of colors of such a coloring c is called the equitable adjacent strong chromatic index of G.In this paper,we determine the equitable adjacent strong chromatic index of the joins of paths and cycles.Precisely,we show that the equitable adjacent strong chromatic index of the joins of paths and cycles is equal to the maximum degree plus one or two.
|
| 关 键 词： | adjacent strong edge coloring equitable edge coloring joins of paths cycle maximum degree chromatic index. |
| 收稿时间： | 2010/5/30 0:00:00 |
| 修稿时间： | 2011/1/12 0:00:00 |
Equitable Strong Edge Coloring of the Joins of Paths and Cycles |
| |
| Tao WANG,Ming Ju LIU and De Ming LI.Equitable Strong Edge Coloring of the Joins of Paths and Cycles[J].Journal of Mathematical Research with Applications,2012,32(1):11-18. |
| |
| Authors: | Tao WANG Ming Ju LIU and De Ming LI |
| |
| Institution: | Department of Basic Curriculum, North China Institute of Science and Technology, Hebei 065201, P. R. China;LMIB and Department of Mathematics, BeiHang University, Beijing 100083, P. R. China;Department of Mathematics, Capital Normal University, Beijing 100048, P. R. China |
| |
| Abstract: | For a proper edge coloring $c$ of a graph $G$, if the sets of colors of adjacent vertices are distinct, the edge coloring $c$ is called an adjacent strong edge coloring of $G$. Let $c_i$ be the number of edges colored by $i$. If $|c_i-c_j|\le 1$ for any two colors $i$ and $j$, then $c$ is an equitable edge coloring of $G$. The coloring $c$ is an equitable adjacent strong edge coloring of $G$ if it is both adjacent strong edge coloring and equitable edge coloring. The least number of colors of such a coloring $c$ is called the equitable adjacent strong chromatic index of $G$. In this paper, we determine the equitable adjacent strong chromatic index of the joins of paths and cycles. Precisely, we show that the equitable adjacent strong chromatic index of the joins of paths and cycles is equal to the maximum degree plus one or two. |
| |
| Keywords: | adjacent strong edge coloring equitable edge coloring joins of paths cycle maximum degree chromatic index |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
|
