Abstract | ||
---|---|---|
The frequency assignment problem is to assign a frequency which is a nonnegative integer to each radio transmitter so that interfering transmitters are assigned frequencies whose separation is not in a set of disallowed separations. This frequency assignment problem can be modelled with vertex labelings of graphs. An L(2, 1)-labeling of a graph G is a function f from the vertex set V(G) to the set... |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/TCSII.2008.922450 | IEEE Transactions on Circuits and Systems II: Express Briefs |
Keywords | Field | DocType |
Frequency,Radio transmitters,Labeling,Upper bound,Graph theory,Contracts,Mathematics,Standards development,User-generated content | Integer,Adjacency matrix,Graph theory,Discrete mathematics,Combinatorics,Direct product,Vertex (geometry),Upper and lower bounds,Cartesian product,Mathematics,Lambda | Journal |
Volume | Issue | ISSN |
55 | 8 | 1549-7747 |
Citations | PageRank | References |
5 | 0.46 | 11 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Wai Chee Shiu | 1 | 167 | 28.28 |
Zhendong Shao | 2 | 67 | 8.60 |
Kin Keung Poon | 3 | 8 | 1.22 |
David Zhang | 4 | 2337 | 102.40 |