On the Antipodal Number of Cartesian Product ...

On the Antipodal Number of Cartesian Product of Cycles

Author Name : Laxman Saha

A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels (non-negative integers) to the stations in an optimal way such that interference is avoided reported by Hale (2005). The antipodal colorings of graphs are a special type of channel assignment problem.