The Geometric Index of the Wheel, Wn

The geometric index of a graph G is defined as the smallest non-negative integer n such that a graph G is a unit graph in r. Graphs considered are finite, undirected, without loops nor multiple edges. Also, edge crossings are allowed in the figures but distinct vertices must have distinct coordinates and that the line segment joining adjacent vertices must not pass through any other vertex. In this paper, the geometric index g of the wheel W_n (n 3, 4, 5,…) is discovered and proven. The results of this study may serve as a benchmark information to other researchers interested in expanding the study of geometric index on all graphs.