No Detail Found!

Multilevel distance labeling for the graphs having diameter equal to diameter of cycle.

Author(s)
Saima Nazeer Department of Mathematics, Lahore College for Women University, Lahore, Pakistan
Imrana Kousar Department of Mathematics, Lahore College for Women University, Lahore, Pakistan
Waqas Nazeer Department of Mathematics, Lahore Leads University, Lahore, Pakistan
Abstract
A Radio labeling of the graph G is a function g from the vertex set V(G) of G to N∪{0}such thatf(u)-f(v) |≥ diam(G)+1- dG (u.v) , where diam(G) and dG (u v) are diameter and distance between u and v in graph G respectively. The radio number rn (G) of G is the smallest number k such that G has radio labeling with max{ f (v) v∈V (G)} = k . We investigate radio number for the graphs having diameter equal to the diameter of cycle.
Publication Details
Page(s) 557-563
DOI DOI not available
Published Journal: Science International, Volume: 26, Issue: 2, Year: 2014

Request the full text from PASTIC

0

Citations

0

Downloads

45

Views