Reflection of Duplicating Operations in the Graphs Pnand Pn°K1Based on the F-Centroidal Meanness Property

A graph admits flooring function of centroidal meanness property if its injective node assignment ? is from 1 to 1 + qalong with bijective link assignment ??(uv) = ?1/3G(u, v)[?(u)2+ G(u, v)2+ ?(v)2]?, where G(u, v) = ?(u) + ?(v), is from 1 to q. We examined the flooring function of centroidal meanness values of a few duplicates yielded graphs in this context.