Name
Abstract | ||
|---|---|---|
The frequency assignment problem is to assign a frequency which is a nonnegative integer to each radio trans- mitter 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 of all nonnegative integers such that jf(x)¡f(y)j ‚ 2 if d(x;y) = 1 and jf(x)¡f(y)j ‚ 1 if d(x;y) = 2, where d(x;y) denotes the distance between x and y in G. The L(2;1)-labeling number ‚(G) of G is the smallest number k such that G has an L(2;1)-labeling with maxff(v) : v 2 V (G)g = k. This paper considers the graph formed by the direct product and the strong product of two graphs and gets better bounds than those of (14) with refined approaches. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/TCSII.2008.921411 | IEEE Transactions on Circuits and Systems II: Express Briefs |
Keywords | DocType | Volume |
CELLULAR RADIO NETWORKS,CHANNEL ASSIGNMENT,CYCLES | Journal | 55 |
Issue | ISSN | Citations |
7 | null | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhendong Shao | 1 | 67 | 8.60 |
| Sandi Klav | 2 | 0 | 0.34 |
| David Zhang | 3 | 2337 | 102.40 |