For positive integers k, d1, d2, a kL (d1, d2)-labeling of a graph G is a function f: V (G)→{0, 1, 2,…, k} such that| f (u)-f (v)|⩾ di whenever the distance between u and v is i in G, for i= 1, 2 …
T Calamoneri - The computer journal, 2006 - ieeexplore.ieee.org
Given any fixed non-negative integer values h and k, the L (h, k)-labelling problem consists in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes …
J Chen, Q Yu, B Chai, Y Sun, Y Fan… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
Multiple channels in Wireless Sensor Networks (WSNs) are often exploited to support parallel transmission and to reduce interference. However, the extra overhead posed by the …
The rapid progress of mobile, wireless communication and embedded micro-sensing MEMS technologies has brought about the rise of pervasive computing. Wireless local-area …
Connectivity is an important key performance indicator and a focal point of research in large- scale wireless networks. Due to path-loss attenuation of electromagnetic waves, direct …
J Ma, T Nagatsuma, SJ Kim… - … conference on artificial …, 2019 - ieeexplore.ieee.org
Multi-channel technique benefits IoT network by support parallel transmission and reduce interference. However, the extra overhead posed by the multi-channel usage coordination …
MAC Lima, AFR Araujo… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
Two adaptive genetic algorithms (GAs), namely GA for locking channel (GALC) and GA for switching channel (GASC), are proposed for a dynamic channel assignment in mobile …
JR Griggs - Discrete Applied Mathematics, 2009 - Elsevier
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 …
S Klavžar, A Vesel - Discrete Applied Mathematics, 2003 - Elsevier
Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer-based approach for searching graph invariants on rotagraphs is proposed and …