| 题名 |
Strong Edge Coloring of Cube-Connected Cycles Graph |
| DOI |
10.29428/9789860544169.201801.0046 |
| 作者 |
Yung-Ling Lai；Ming-Jin Xiao |
| 关键词 |
strong edge coloring ； cube-connected cycles |
| 期刊名称 |
NCS 2017 全國計算機會議 |
| 卷期/出版年月 |
2017（2018 / 01 / 01） |
| 页次 |
243 - 245 |
| 内容语文 |
英文 |
| 中文摘要 |
A strong edge colouring of a graph G is an edge coloring in which every color class is an induced matching. The strong chromatic index of a graph G is the minimum number of colors in a strong edge colouring of G. The channel assignment problem is to assign a radio channel to every transmitter and make sure that every adjacent transmitters are interference-free of each other. It can be modelled as a strong edge coloring problem that colors present channels and vertices present transmitters. This paper gave bounds for the strong chromatic index of cube-connected cycles networks and obtained exact result of certain cases. |
| 主题分类 |
基礎與應用科學 >
資訊科學 |
