Name
Abstract | ||
|---|---|---|
Given non-negative integers j and k, an L(j,k)-labeling of a graph G is a function f from the vertex set V(G) to the set of all non-negative integers such that |f(x)−f(y)|≥j if d(x,y)=1 and |f(x)−f(y)|≥k if d(x,y)=2. The L(j,k)-labeling number λj,k is the smallest number m such that there is an L(j,k)-labeling with the largest value m and the smallest label 0. This paper presents upper bounds on λ2,1 and λ2,1 of a graph G in terms of the maximum degree of G for several classes of planar graphs. These bounds are the same as or better than previous results for the maximum degree less than or equal to 4. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.aml.2006.02.033 | Applied Mathematics Letters |
Keywords | Field | DocType |
Channel assignment,Distance two graph labeling | Integer,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Degree (graph theory),Mathematics,Planar graph,Graph labelling | Journal |
Volume | Issue | ISSN |
20 | 2 | 0893-9659 |
Citations | PageRank | References |
9 | 0.56 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhendong Shao | 1 | 67 | 8.60 |
| Roger K. Yeh | 2 | 521 | 38.16 |