Let G(V, E) be a graph with p vertices and q edges. For every assignment f : V (G) → {0, 1, 2, . . . , q}, consider an induced edge labeling if f (u) and f (v) are of the same parity, q}, then we say that f is a mean labeling of G. If a graph G admits a mean labeling, then G is called a mean graph. In this paper, we study the meanness of arbitrary path super subdivision of the graph P n .