A series of lectures on "radio labeling"

Speaker: Prof. Soumen Nandi, IEM Kolkata

Title: An overview of radio labeling of simple graph classes.

Abstarct: An L(3,2,1)-labeling is a simplified model for the Channel Assignment Problem. An L(3,2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of non-negative integers such that for any two vertices x,y, if d(x,y) = 1, then |f(x) − f(y)| ≥ 3; if d(x,y) = 2, then |f(x) − f(y)| ≥ 2; and if d(x,y) = 3, then |f(x) − f(y)| ≥ 1. The L(3,2,1)-labeling span λ(G) of G is the smallest positive integer n such that G has an L(3,2,1)-labeling with n as the maximum label. Here we discuss the L(3,2,1)-labeling number for paths, cycles, complete graphs, and complete bipartite graphs etc. We also present an upper bound for λ(G) in terms of the maximum degree ∆ of G.

Event Date: 2nd December, 2020

Event Time: 03:10 PM

Venue: Online seminar

Copyright 2018 @IITDH. All rights are reserved