Add to ORKGA Langford sequence of order m and defect d can be identified with a labeling of the vertices of a path of order 2m in which each labeled from d up to d + m - 1 appears twice and in which the vertices that have been label with k are at distance k. In this paper, we introduce two generalizations of this labeling that are related to distances.Articles in this journal are published under Creative Commons Attribution 3.0 License http://creativecommons.org/licenses/by/3.0
Abstract. Given a simple graph G (V, E) and a positive number d, an Ld(2, 1)-labelling of G is a fun...
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a ...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
Let G = (V(G), E(G)) be a connected graph. For integers j ≥ k, L ( j, k)-labeling of a graph G is an...
AbstractAn L(2,1)-labeling of a graph G is a function f from the vertex set of G to the set of nonne...
AbstractFor positive integers k,d1,d2, a k-L(d1,d2)-labeling of a graph G is a function f:V(G)→{0,1,...
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...
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...
For positive integers j ≥ k, an L(j, k)-labeling of a digraph D is a function f from V (D) into the ...
AbstractFor positive integers j⩾k, an L(j,k)-labeling of a digraph D is a function f from V(D) into ...
AbstractLet j≥k≥0 be integers. An ℓ-L(j,k)-labelling of a graph G=(V,E) is a mapping ϕ:V→{0,1,2,…,ℓ}...
A distance labeling scheme is a distributed data-structure designed to answer queries about distance...
If d(x, y) denotes the distance between vertices x and y in a graph G, then an L(2, 1)-labeling of a...
Abstract. Given a simple graph G (V, E) and a positive number d, an Ld(2, 1)-labelling of G is a fun...
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a ...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
Let G = (V(G), E(G)) be a connected graph. For integers j ≥ k, L ( j, k)-labeling of a graph G is an...
AbstractAn L(2,1)-labeling of a graph G is a function f from the vertex set of G to the set of nonne...
AbstractFor positive integers k,d1,d2, a k-L(d1,d2)-labeling of a graph G is a function f:V(G)→{0,1,...
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...
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...
For positive integers j ≥ k, an L(j, k)-labeling of a digraph D is a function f from V (D) into the ...
AbstractFor positive integers j⩾k, an L(j,k)-labeling of a digraph D is a function f from V(D) into ...
AbstractLet j≥k≥0 be integers. An ℓ-L(j,k)-labelling of a graph G=(V,E) is a mapping ϕ:V→{0,1,2,…,ℓ}...
A distance labeling scheme is a distributed data-structure designed to answer queries about distance...
If d(x, y) denotes the distance between vertices x and y in a graph G, then an L(2, 1)-labeling of a...
Abstract. Given a simple graph G (V, E) and a positive number d, an Ld(2, 1)-labelling of G is a fun...
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...