Published February 9, 2010
| Version v1
Journal article
Open
Radio Number of Cube of a Path
Authors/Creators
Description
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.
Files
RadioNumber.pdf
Files
(456.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:cb82853ad21f9e209d947a84f298ba47
|
456.5 kB | Preview Download |