Let be a graph with vertex set and edge set . Let denote the diameter of and denote the distance between the vertices and in . An antipodal labeling of with diameter is a function that assigns to each vertex , a positive integer , such that , for all . The span of an antipodal labeling is . The antipodal number for , denoted by , is the minimum span of all antipodal labelings of . Determining the antipodal number of a graph is an NP-complete problem. In this paper, we determine the antipodal number of certain graphs.