An L（3, 2, 1）-labeling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that ｜f（u）-f（v）｜≥3 if dG（u,v） = 1, ｜f（u）-f（v）｜≥2 if dG（u,v） = 2, and ｜f（u...An L（3, 2, 1）-labeling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that ｜f（u）-f（v）｜≥3 if dG（u,v） = 1, ｜f（u）-f（v）｜≥2 if dG（u,v） = 2, and ｜f（u）-f（v）｜≥1 if dG（u,v） = 3. The L（3, 2,1）-labeling problem is to find the smallest number λ3（G） such that there exists an L（3, 2,1）-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of λ3 for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree T such that λ3（T） attains the minimum value.展开更多
L (2, 1)-labeling number, λ(G( Z , D)) , of distance graph G( Z , D) is studied. For general finite distance set D , it is shown that 2D+2≤λ(G( Z , D))≤D 2+3D. Furthermore, λ(G( Z , D)) ≤8 when...L (2, 1)-labeling number, λ(G( Z , D)) , of distance graph G( Z , D) is studied. For general finite distance set D , it is shown that 2D+2≤λ(G( Z , D))≤D 2+3D. Furthermore, λ(G( Z , D)) ≤8 when D consists of two prime positive odd integers is proved. Finally, a new concept to study the upper bounds of λ(G) for some special D is introduced. For these sets, the upper bound is improved to 7.展开更多
A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this pape...A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this paper, we show that for or 11, which confirms Conjecture 6.1 stated in [X. Li, V. Mak-Hau, S. Zhou, The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups, J. Comb. Optim. (2013) 25: 716-736] in the case when or 11. Moreover, we show that? if 1) either (mod 6), m is odd, r = 3, or 2) (mod 3), m is even (mod 2), r = 0.展开更多
An L(h,k)-labeling of a graph G is an assignment of non-negative integers to the vertices such that if two vertices u and v are adjacent then they receive labels that differ by at least h, and when u and v are not adj...An L(h,k)-labeling of a graph G is an assignment of non-negative integers to the vertices such that if two vertices u and v are adjacent then they receive labels that differ by at least h, and when u and v are not adjacent but there is a two-hop path between them, then they receive labels that differ by at least k. The span λ of such a labeling is the difference between the largest and the smallest vertex labels assigned. Let λ<sub>h</sub>k</sup> ( G )denote the least λ such that G admits an L(h,k) -labeling using labels from {0,1,...λ}. A Cayley graph of group is called circulant graph of order n, if the group is isomorphic to Z<sub>n.</sub> In this paper, initially we investigate the L(h,k) -labeling for circulant graphs with “large” connection sets, and then we extend our observation and find the span of L(h,k) -labeling for any circulants of order n. .展开更多
The L(2,1)-labelling number of distance graphs G(D), denoted by λ(D), isstudied. It is shown that distance graphs satisfy λ(G) ≤Δ~2. Moreover, we prove λ({1,2, ..., k})=2k +2 and λ({1,3,..., 2k -1}) =2k + 2 for ...The L(2,1)-labelling number of distance graphs G(D), denoted by λ(D), isstudied. It is shown that distance graphs satisfy λ(G) ≤Δ~2. Moreover, we prove λ({1,2, ..., k})=2k +2 and λ({1,3,..., 2k -1}) =2k + 2 for any fixed positive integer k. Suppose k, a ∈ N and k,a≥2. If k≥a, then λ({a, a + 1,..., a + k - 1}) = 2(a + k-1). Otherwise, λ({a, a + 1, ..., a + k- 1}) ≤min{2(a + k-1), 6k -2}. When D consists of two positive integers,6≤λ(D)≤8. For thespecial distance sets D = {k, k + 1}(any k ∈N), the upper bound of λ(D) is improved to 7.展开更多
Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v...Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v) =2. The L(d, 1)-labeling number of G, lambda_d(G) is theminimum range span of labels over all such labelings, which is motivated by the channel assignmentproblem. We consider the question of finding the minimum edge span beta_d( G) of this labeling.Several classes of graphs such as cycles, trees, complete k-partite graphs, chordal graphs includingtriangular lattice and square lattice which are important to a telecommunication problem arestudied, and exact values are given.展开更多
L(d, 1)-labeling is a kind of graph coloring problem from frequency assignment in radio networks, in which adjacent nodes must receive colors that are at least d apart while nodes at distance two from each other must ...L(d, 1)-labeling is a kind of graph coloring problem from frequency assignment in radio networks, in which adjacent nodes must receive colors that are at least d apart while nodes at distance two from each other must receive different colors. We focus on L(d, 1)-labeling of regular tilings for d≥3 since the cases d=0, 1 or 2 have been researched by Calamoneri and Petreschi. For all three kinds of regular tilings, we give their L (d, 1)-labeling numbers for any integer d≥3. Therefore, combined with the results given by Calamoneri and Petreschi, the L(d, 1)-labeling numbers of regular tilings for any nonnegative integer d may be determined completely.展开更多
基金The NSF (60673048) of China the NSF (KJ2009B002,KJ2009B237Z) of Education Ministry of Anhui Province.
文摘An L（3, 2, 1）-labeling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that ｜f（u）-f（v）｜≥3 if dG（u,v） = 1, ｜f（u）-f（v）｜≥2 if dG（u,v） = 2, and ｜f（u）-f（v）｜≥1 if dG（u,v） = 3. The L（3, 2,1）-labeling problem is to find the smallest number λ3（G） such that there exists an L（3, 2,1）-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of λ3 for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree T such that λ3（T） attains the minimum value.
文摘L (2, 1)-labeling number, λ(G( Z , D)) , of distance graph G( Z , D) is studied. For general finite distance set D , it is shown that 2D+2≤λ(G( Z , D))≤D 2+3D. Furthermore, λ(G( Z , D)) ≤8 when D consists of two prime positive odd integers is proved. Finally, a new concept to study the upper bounds of λ(G) for some special D is introduced. For these sets, the upper bound is improved to 7.
文摘A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this paper, we show that for or 11, which confirms Conjecture 6.1 stated in [X. Li, V. Mak-Hau, S. Zhou, The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups, J. Comb. Optim. (2013) 25: 716-736] in the case when or 11. Moreover, we show that? if 1) either (mod 6), m is odd, r = 3, or 2) (mod 3), m is even (mod 2), r = 0.
基金National Natural Science Foundation of China(No.10671074 and No.60673048)Natural Science Foundation of Education Ministry of Anhui Province(No.KJ2007B124 and No.2006KJ256B)
文摘An L(h,k)-labeling of a graph G is an assignment of non-negative integers to the vertices such that if two vertices u and v are adjacent then they receive labels that differ by at least h, and when u and v are not adjacent but there is a two-hop path between them, then they receive labels that differ by at least k. The span λ of such a labeling is the difference between the largest and the smallest vertex labels assigned. Let λ<sub>h</sub>k</sup> ( G )denote the least λ such that G admits an L(h,k) -labeling using labels from {0,1,...λ}. A Cayley graph of group is called circulant graph of order n, if the group is isomorphic to Z<sub>n.</sub> In this paper, initially we investigate the L(h,k) -labeling for circulant graphs with “large” connection sets, and then we extend our observation and find the span of L(h,k) -labeling for any circulants of order n. .
文摘The L(2,1)-labelling number of distance graphs G(D), denoted by λ(D), isstudied. It is shown that distance graphs satisfy λ(G) ≤Δ~2. Moreover, we prove λ({1,2, ..., k})=2k +2 and λ({1,3,..., 2k -1}) =2k + 2 for any fixed positive integer k. Suppose k, a ∈ N and k,a≥2. If k≥a, then λ({a, a + 1,..., a + k - 1}) = 2(a + k-1). Otherwise, λ({a, a + 1, ..., a + k- 1}) ≤min{2(a + k-1), 6k -2}. When D consists of two positive integers,6≤λ(D)≤8. For thespecial distance sets D = {k, k + 1}(any k ∈N), the upper bound of λ(D) is improved to 7.
文摘Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v) =2. The L(d, 1)-labeling number of G, lambda_d(G) is theminimum range span of labels over all such labelings, which is motivated by the channel assignmentproblem. We consider the question of finding the minimum edge span beta_d( G) of this labeling.Several classes of graphs such as cycles, trees, complete k-partite graphs, chordal graphs includingtriangular lattice and square lattice which are important to a telecommunication problem arestudied, and exact values are given.
文摘L(d, 1)-labeling is a kind of graph coloring problem from frequency assignment in radio networks, in which adjacent nodes must receive colors that are at least d apart while nodes at distance two from each other must receive different colors. We focus on L(d, 1)-labeling of regular tilings for d≥3 since the cases d=0, 1 or 2 have been researched by Calamoneri and Petreschi. For all three kinds of regular tilings, we give their L (d, 1)-labeling numbers for any integer d≥3. Therefore, combined with the results given by Calamoneri and Petreschi, the L(d, 1)-labeling numbers of regular tilings for any nonnegative integer d may be determined completely.
