Add to ORKGAn L(4, 3, 2, 1)-labeling of a vertex-edge graph G is a function f that assigns either 0 or a specific positive integer as a label to each vertex with the following condition: given 2 vertices, the sum of the difference of their labels and their distance in the graph must be at least 5. Symbolically: |f(u) − f(v)| + d(u, v) ≥ 5 if u ≠ v. The L(4, 3, 2, 1)-labeling number of a vertex-edge graph G is the smallest positive integer k, such that the condition previously stated is followed, and there is no label greater than k. In this paper, we show the L(4, 3, 2, 1)-labeling number of several types of graphs including cycles, paths, spider graphs, stars, and some caterpillars
AbstractA k-L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
AbstractA k-L(d,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
An L(4, 3, 2, 1)-labeling of a vertex-edge graph G is a function f that assigns either 0 or a specif...
The L(2, 1)-labeling of a graph G is a mapping f : (V(G) → Z* such that | f(u) - f(v) | ≥ 2 if d(u, ...
Let G = (V(G), E(G)) be a connected graph. For integers j ≥ k, L ( j, k)-labeling of a graph G is an...
Let G be a connected, undirected graph. Distance two labeling or a L(2,1)- labeling of a graph G is ...
AbstractGiven a graph G and integers p,q,d1 and d2, with p>q, d2>d1⩾1, an L(d1,d2;p,q)-labeling of G...
AbstractGiven a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assig...
AbstractFor positive integers k,d1,d2, a k-L(d1,d2)-labeling of a graph G is a function f:V(G)→{0,1,...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
Abstract. Given a simple graph G (V, E) and a positive number d, an Ld(2, 1)-labelling of G is a fun...
An L(2, 1)-labelling of a graph G is a function f from the vertex set V(G) to the set of all nonnega...
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labelin...
AbstractA k-L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
AbstractA k-L(d,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
An L(4, 3, 2, 1)-labeling of a vertex-edge graph G is a function f that assigns either 0 or a specif...
The L(2, 1)-labeling of a graph G is a mapping f : (V(G) → Z* such that | f(u) - f(v) | ≥ 2 if d(u, ...
Let G = (V(G), E(G)) be a connected graph. For integers j ≥ k, L ( j, k)-labeling of a graph G is an...
Let G be a connected, undirected graph. Distance two labeling or a L(2,1)- labeling of a graph G is ...
AbstractGiven a graph G and integers p,q,d1 and d2, with p>q, d2>d1⩾1, an L(d1,d2;p,q)-labeling of G...
AbstractGiven a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assig...
AbstractFor positive integers k,d1,d2, a k-L(d1,d2)-labeling of a graph G is a function f:V(G)→{0,1,...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
Abstract. Given a simple graph G (V, E) and a positive number d, an Ld(2, 1)-labelling of G is a fun...
An L(2, 1)-labelling of a graph G is a function f from the vertex set V(G) to the set of all nonnega...
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labelin...
AbstractA k-L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
AbstractA k-L(d,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...