Name
Abstract | ||
|---|---|---|
Let k be a positive integer. A k-circular-L(2, 1)-labelling of a graph G is an assignment f from V(G) to {0, 1, ..., k-1} such that, for any two vertices u and v, |f(u) -f(v)|k ≥ 2 if u and v are adjacent, and |f(u) -f(v)|k ≥ 1 if u and v are at distance 2, where |x|k = min{|x|, k-|x|}. The minimum k such that G admits a k-circular-L(2, 1)-labelling is called the circular-L(2, 1)-labelling number (or just the σ-number) of G, denoted by σ(G). The exact values of σ(Pm ⊗ Cn) and σ(Cm ⊗ Cn) for some m and n have been determined in this study. Finally, it has been concluded that σ(Cm ⊗ Cn) ≤ 13 for n ≥ m ≥ 220. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1049/iet-com.2013.0635 | IET Communications |
Keywords | Field | DocType |
frequency assignment problem,cycle products,frequency allocation,1)-labelling number,graph,graph theory,circular-l(2,path products | Integer,Frequency assignment problem,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Bound graph,Labelling,Mathematics | Journal |
Volume | Issue | ISSN |
8 | 5 | 1751-8628 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuan Yan Tang | 1 | 2662 | 209.20 |
| Zehui Shao | 2 | 119 | 30.98 |
| Fangnian Lang | 3 | 104 | 4.92 |
| Xiaodong Xu | 4 | 26 | 9.91 |
| Roger K. Yeh | 5 | 521 | 38.16 |