A λ-coloring of a graph G is an assignment of colors from the integer set {0,…, λ} to the
vertices of the graph G such that vertices at distance of at most two get different colors and …

L (h, 1)-labeling, h= 0, 1, 2, is a class of coloring problems arising from frequency
assignment in radio networks, in which adjacent nodes must receive colors that are at least …

The interference imposes a significant negative impact on the performance of wireless
networks. With the continuous deployment of larger and more sophisticated wireless …

Abstract An L (2, 1) L (2, 1)-labeling of a graph G=(V, E) G=(V, E) is a function ff from the
vertex set V (G) V (G) to the set of non-negative integers such that adjacent vertices get …

Given an integer/spl sigma/> 1, a vector (/spl delta//sub 1/,/spl delta//sub 2/,...,/spl
delta//sub/spl sigma/-1/), of nonnegative integers, and an undirected graph G=(V, E), an L …

Abstract An L (2, 1)-labeling of a graph is an assignment of non-negative integers, called
colours to the vertex set of G such that the difference between the colours assigned to …

The design of a cellular network is a complex process that encompasses the selection and
configuration of cell sites and the supporting network infrastructure. This investigation …

An L (2, 1)-labelling of a graph $ G=(V, E) $ is $\lambda_ {2, 1}(G) $ a function $ f $ from the
vertex set V (G) to the set of non-negative integers such that adjacent vertices get numbers …

Chapter 5 gives an overview of algorithms and lower bounds for channel assignment
problems in cellular networks, when adjacent and inter‐site channel interference are …

The need for smart and sustainable communication systems has led to the development of
mobile communication networks. In turn, the vast functionalities of the global system of …