Circular L(d,1)-labellings on Graphs
碩士 === 逢甲大學 === 應用數學系 === 88 === It is well-known that the vertex-labelling of graphs , where the labels are non-negative integers , provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio ch...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13122230518247215290 |