The exact distance p-power of a graph G, denoted G[#p], is on vertex set V(G) in which two vertices are adjacent if they at exactly p G. Given integers k and p, we define f(k, p) to be the maximum possible order clique p-powers graphs with degree + 1. It easily observed that 2) ≤ k2 We prove equality may only hold connected component G isomorphic member class Pk incidence finite projective k-ge...
