AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh [Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586–595] to model the channel assignment problem. In this paper we improve the best known upper bound for the L(p,1)-labelling of graphs with given maximum degree. We show that for any integer p⩾2, any graph G with maximum degree Δ admits an L(p,1)-labelling such that the labels range from 0 to Δ2+(p-1)Δ-2
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
The theory of integer λ-labellings of a graph, introduced by Griggs and Yeh, seeks to model efficien...
AbstractAn L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-nega...
In this paper we improve the best known bound for the $L(p,1)$-labelling of graphs with given maxima...
AbstractGiven a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assig...
A variation of the channel assignment problem is naturally modeled by L(2, 1)-labelings of graphs. ...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
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...
An L(2, 1)-labelling of a graph is a function f from the vertex set to the positive integers such th...
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a...
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...
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...
In order to better study the channel assignment problem, a function from the vertex set to the set o...
The problem of radio channel assignments with multiple levels of interference can be modelled using ...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
The theory of integer λ-labellings of a graph, introduced by Griggs and Yeh, seeks to model efficien...
AbstractAn L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-nega...
In this paper we improve the best known bound for the $L(p,1)$-labelling of graphs with given maxima...
AbstractGiven a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assig...
A variation of the channel assignment problem is naturally modeled by L(2, 1)-labelings of graphs. ...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
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...
An L(2, 1)-labelling of a graph is a function f from the vertex set to the positive integers such th...
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a...
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...
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...
In order to better study the channel assignment problem, a function from the vertex set to the set o...
The problem of radio channel assignments with multiple levels of interference can be modelled using ...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
The theory of integer λ-labellings of a graph, introduced by Griggs and Yeh, seeks to model efficien...
AbstractAn L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-nega...
DOI
Add to ORKG