Graph labellings form an important graph theory model for the channel assignment problem.
An optimum labelling usually depends on one or more parameters that ensure minimum …

The theory of integer λ-labellings of a graph, introduced by Griggs and Yeh JR Griggs and
RK-C. Yeh, SIAM J. Discrete Math., 5 (1992), pp. 586-595, seeks to model efficient channel …

We consider the problem of assigning a numerical channel to each transmitter in a large
regular array such that multiple levels of interference, which depend on the distance …

The problem of radio channel assignments with multiple levels of interference can be
modeled using graph theory. Given a graph G, possibly infinite, and real numbers k/sub 1 …

We establish new lower and upper bounds for the real number graph labelling problem. As
an application, we consider a problem of Griggs to determine the optimum spans of L(p,q) …

The integer graph labeling problem with distance conditions, as a generalized graph
coloring problem, originally comes from a radio channel assignment problem in wireless …

Numerical channels must be assigned to each transmitter in a large regular array such that
multiple levels of interference, which depend on the distance between transmitters, are …

We establish new lower and upper bounds for the real number graph labelling problem. As
an application, we completely determine the optimum spans of L (p; q)-labellings of the in …

Increasing attention is being paid to the study of families of subsets of an nset that contain no
subposet P. Especially, we are interested in such families of maximum size given P and n …