- 會議論文
- OpenAccess
Strong Edge Coloring of Cube-Connected Cycles Graph
摘要
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.