Radio Number Of Cube Of A Path
B. Sooryanarayana, M. Vishu Kumar, Manjula, K. · Zenodo (CERN European Organization for Nuclear Research) · 2010
Let G be a connected graph. For any two vertices u and v, let d(u; v) denotes the distance between u and v in G. The maximum distance between any pair of vertices is called the diameter of G and is denoted by diam(G). A Smarandachely k-radio labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G.