Reflection of Duplicating Operations in the Graphs Pn and Pn∘K1 Based on the F‐Centroidal Meanness Property
A. Rajesh Kannan, Karuppusamy Loganathan, P. Usha, Balachandra Pattanaik · Journal of Mathematics · 2024
A graph admits flooring function of centroidal meanness property if its injective node assignment Λ is from 1 to 1 + q along with bijective link assignment Λ⋆(uv) = ⌊1/3Γ(u, v)[Λ(u)2 + Γ(u, v)2 + Λ(v)2]⌋, where Γ(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.