Saima Nazeer

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A radio k-labeling c of a graph G is a mapping c : V (G) → Z + ∪{0} such that d(u, v)+|c(u)−c(v)| ≥ k+1 for every two distinct vertices u and v of G, where d(u, v) is the distance between any two vertices u and v of G. The span of a radio k-labeling c is denoted by sp(c) and defined as max{|c(u) − c(v)| : u, v ∈ V (G)}. The radio labeling is a radio(More)
  • 1