Taiwanese Journal of Mathematics
- Taiwanese J. Math.
- Volume 4, Number 4 (2000), 675-683.
THE EDGE SPAN OF DISTANCE TWO LABELLINGS OF GRAPHS
The radio channel assignment problem can be cast as a graph coloring problem. Vertices correspond to transmitter locations and their labels (colors) to radio channels. The assignment of frequencies to each transmitter (vertex) must avoid interference which depends on the seperation each pair of vertices has. Two levels of interference are assumed in the problem we are concerned. Based on this channel assignment problem, we proposed a graph labelling problem which has two constraints instead of one. We consider the question of finding the minimum edge of this labelling. Several classes of graphs including one that is important to a telecommunication problem have been studied.
Taiwanese J. Math., Volume 4, Number 4 (2000), 675-683.
First available in Project Euclid: 18 July 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Yeh, Roger K. THE EDGE SPAN OF DISTANCE TWO LABELLINGS OF GRAPHS. Taiwanese J. Math. 4 (2000), no. 4, 675--683. doi:10.11650/twjm/1500407301. https://projecteuclid.org/euclid.twjm/1500407301