Name
Abstract | ||
|---|---|---|
An L(2,1)-labeling of a graph G is a function f from the vertex set V(G) into the set of nonnegative integers such that |f(x)−f(y)|≥2 if d(x,y)=1 and |f(x)−f(y)|≥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 minimum k where G has an L(2,1)-labeling f with k being the absolute difference between the largest and smallest image points of f. In this work, we will study the L(2,1)-labeling on K1,n-free graphs where n≥3 and apply the result to unit sphere graphs which are of particular interest in the channel assignment problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.aml.2007.12.020 | Applied Mathematics Letters |
Keywords | Field | DocType |
Channel assignment,L(2,1)-labeling,K1,n-free simple graph,Unit sphere graph | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Channel assignment problem,Mathematics,Unit sphere,Graph labelling,Absolute difference | Journal |
Volume | Issue | ISSN |
21 | 11 | 0893-9659 |
Citations | PageRank | References |
2 | 0.39 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhendong Shao | 1 | 67 | 8.60 |
| Roger K. Yeh | 2 | 521 | 38.16 |
| Kin Keung Poon | 3 | 8 | 1.22 |
| Wai Chee Shiu | 4 | 167 | 28.28 |