Reflection of Duplicating Operations in the Graphs Pn and Pn∘K1 Based 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 + q along with bijective link assignment Λ ⋆ ( u v ) = ⌊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.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.