• Title/Summary/Keyword: radio graceful graphs

Search Result 1, Processing Time 0.013 seconds

RADIO NUMBER OF TRANSFORMATION GRAPHS OF A PATH

  • YOGALAKSHMI, S.;SOORYANARAYANA, B.;RAMYA, RAMYA
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.1_2
    • /
    • pp.59-74
    • /
    • 2017
  • A radio labeling of a graph G is a function $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ with the property that ${\mid}f(u)-f(v){\mid}{\geq}1+diam(G)-d(u,v)$ for every pair of vertices $u,v{\in}V(G)$, where diam(G) and d(u, v) are diameter and distance between u and v in the graph G respectively. The radio number of a graph G, denoted by rn(G), is the smallest integer k such that G admits a radio labeling. In this paper, we completely determine radio number of all transformation graphs of a path.