For a connected graph G , let d(x, y) denote the distance between any two vertices in G , which is the length of the shortest path between them. The diameter of G is the maximum distance between any pair of vertices of G denoted by diam (G). A radio labeling of G is an assignment of positive integer to the vertices of G such that for any vertices x and y the following inequality f (x) − f (y) |≥ diam(G) − d(x, y) +1 holds. The span of a radio labeling is the maximum integer assigned to a vertex. The radio number of a graph G is the minimum span taken over all radio labelings of G . In this paper, we determine the radio number for the prism related graphs, n D∗ when n = 4k + 2 .