Name
Abstract | ||
|---|---|---|
An interesting graph distance constrained labelling problem can model the frequency channel assignment problem as well as code assignment in computer networks. The frequency assignment problem asks for assigning frequencies to transmitters in a broadcasting network with the aim of avoiding undesired interference. One of the graph theoretical models of The frequency assignment problem is the concept of distance constrained labelling of graphs. Let u and v be vertices of a graph G = (V (G),E(G)) and d(u, v) be the distance between u and v in G. For an integer d ≥ 0, an L(d, 1)-labelling of G is a function f : V (G) → {0, 1, · · · } such that for every u, v ϵ V (G), |f(u) – f(v)| ≥ d if d(u, v) = 1 and |f(u) – f(v)| ≥ 1 if d(u, v) = 2. The span of f is the difference between the largest and the smallest numbers in f(V (G)). The λd,1-number of G is the minimum span over all L(d, 1)-labellings of G. For natural numbers n and k, where n u003e 2k, a generalised Petersen graph P(n, k) is obtained by letting its verte... |
Year | Venue | Field |
|---|---|---|
2018 | IJAACS | Integer,Graph,Natural number,Combinatorics,Vertex (geometry),Computer science,Computer network,Distance,Code assignment,Petersen graph,D-1 |
DocType | Volume | Issue |
Journal | 11 | 2 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fei Deng | 1 | 19 | 6.59 |
| Xiaoling Zhong | 2 | 1 | 3.76 |
| Zehui Shao | 3 | 119 | 30.98 |