The Padmakar-Ivan (PI) index of a graph G is defined as P I(G) = Pe2E(G) (jV (G)j NG(e)), where NG(e) is the number of equidistant vertices for the edge e. A graph is perfect if for every induced subgraph H, the equation (H) = ! (H) holds, where (H) is the chromatic number and ! (H) is the size of a maximum clique of H. In this paper, the PI index of some types of perfect graphs is obtained. These types include co-bipartite graphs, line graphs, and prismatic graphs.