Fourth Edition of the International Conference on Research in Applied Mathematics and Computer Science ICRAMCS 2022
 March 24-25-26, 2022
Online and Face-to-Face Conference

ICRAMCS, 4 (2022) | Proceedings ISSN: 2605-7700

Research Communication | Open Access
Volume 2022 | Communication ID 335
Upper Hamiltonian numbers, upper traceable numbers and radio k-labeling numbers of circulant graphs
Laila Loudiki, Mustapha Kchikech, El Hassan Essaky
Academic Editor: Youssef EL FOUTAYENI
Received
Accepted
Published
January 30, 2022
March 03, 2287
April 15, 2287

Abstract: Graph theory is a branch of discrete mathematics. Motivated by problems in radio channel assignments, we consider radio k-labeling of graphs [1]. For a graph G and an integer k≥1, a radio k-labeling of G is an assignment f of integers to the vertices of G such that \left|f\left(x\right)-f\left(y\right)\right|\geq k+1-d_G\left(x,y\right),\ \bigmfor any two distinct vertices x and y, where d_G\left(x,y\right) is the distance between x and y in G. The radio k-labeling number is the minimum of \max{\{}f\left(x\right):x\in V\left(G\right)\} over all radio k-labeling f of G. The aim of ...