Publication date
January 2005
DOIAbstract
In this paper we improve the best known bound for the $L(p,1)$-labelling of graphs with given maximal degree
In this paper we improve the best known bound for the $L(p,1)$-labelling of graphs with given maximal degree
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labelin...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
An L(2, 1)-labeling of a graph is a mapping c: V (G) → {0,..., K} such that the labels assigned to ...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
AbstractGiven a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assig...
An L(2, 1)-labelling of a graph is a function f from the vertex set to the positive integers such th...
A variation of the channel assignment problem is naturally modeled by L(2, 1)-labelings of graphs. ...
Abstract. An (2,1)L-labelling of a graph ( ,)G V E = is 2,1 ()Gλ a function f from the vertex set ()...
AbstractAn L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all n...
Let G be a connected, undirected graph. Distance two labeling or a L(2,1)- labeling of a graph G is ...
$L(2,1)$-labeling is a graph coloring model inspired by a frequency assignment in telecommunication....
An L (2, 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all nonneg...
An L(2,1)-labeling for a graph G consists of assigning non- negative integers, 0s, to the nodes 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...
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labelin...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
An L(2, 1)-labeling of a graph is a mapping c: V (G) → {0,..., K} such that the labels assigned to ...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
AbstractGiven a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assig...
An L(2, 1)-labelling of a graph is a function f from the vertex set to the positive integers such th...
A variation of the channel assignment problem is naturally modeled by L(2, 1)-labelings of graphs. ...
Abstract. An (2,1)L-labelling of a graph ( ,)G V E = is 2,1 ()Gλ a function f from the vertex set ()...
AbstractAn L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all n...
Let G be a connected, undirected graph. Distance two labeling or a L(2,1)- labeling of a graph G is ...
$L(2,1)$-labeling is a graph coloring model inspired by a frequency assignment in telecommunication....
An L (2, 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all nonneg...
An L(2,1)-labeling for a graph G consists of assigning non- negative integers, 0s, to the nodes 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...
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labelin...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
An L(2, 1)-labeling of a graph is a mapping c: V (G) → {0,..., K} such that the labels assigned to ...
Add to ORKG