| 引用本文： |
-
孙宗剑,罗海鹏.联图P3∨Km,n和C4∨Km,n的邻强边色数[J].广西科学,2010,17(4):284-286. [点击复制]
- SUN Zong-jian,LUO Hai-peng.Adjacent Strong Edge Chromatic Number of Join Graph P3∨Km,n and C4∨Km,n[J].Guangxi Sciences,2010,17(4):284-286. [点击复制]
|
|
| 摘要: |
| 设计一个具有分支限界技术的算法来研究联图P3∨Km,n和C4∨Km,n的k-邻强边染色,并证明m< n-3时它们的邻强边色数均为m+n+3. |
| 关键词: 邻强边色数 k-邻强边染色 完全二部图 联图 |
| DOI： |
| 投稿时间：2010-08-24 |
| 基金项目:国家自然科学基金项目(10901045,10926054,11001073),河北自然科学基金项目(A2010000828)资助。 |
|
| Adjacent Strong Edge Chromatic Number of Join Graph P3∨Km,n and C4∨Km,n |
|
SUN Zong-jian1, LUO Hai-peng2
|
| (1.College of Sciences, Hebei University of Science and Technology, Shijiazhuang, Hebei, 050018, China;2.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China) |
| Abstract: |
| An algorithm is designed to search for the k -adjacent strong edge coloring of join graph P3∨Km, n and C4∨Km, n and χas' (P3∨Km, n)=χas' (C4∨Km, n)=m+n+3 is proved when m<n-3. |
| Key words: adjacent strong edge chromatic number k-adjacent strong edge coloring complete bipartite graph join graph |
