Name
Abstract | ||
|---|---|---|
Let G = (V, E) be a graph. Denote d(G)(u, v) the distance between two vertices u and v in G. An L(2, 1)-labeling of is a function such that for any two vertices and , if and if . The span of is the difference between the largest and the smallest number in . The -number of , denoted , is the minimum span over all -labelings of . In this article, we confirm Conjecture 6.1 stated in X. Li et al. (J Comb Optim 25:716-736, 2013) in the case when (i) is even, or (ii) l <= 5 is odd and 0 <= r <= 8. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10878-014-9763-8 | JOURNAL OF COMBINATORIAL OPTIMIZATION |
Keywords | Field | DocType |
L(2,1)-labeling,Brick product graph,Graph labeling,Frequency assignment problem | Frequency assignment problem,Discrete mathematics,Graph,Biology,Graph labeling,Brick,Natural science,Agroforestry | Journal |
Volume | Issue | ISSN |
31 | 2 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zehui Shao | 1 | 119 | 30.98 |
| Jin Xu | 2 | 13 | 3.03 |
| Roger K. Yeh | 3 | 521 | 38.16 |