Abstract
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.
Reference28 articles.
1. Optimised Levenshtein centroid cross‐layer defence for multi‐hop cognitive radio networks
2. Machine learning-enabled cooperative spectrum sensing for non-orthogonal multiple access;Shi Z.;IEEE Transactions on Wireless Communications,2020
3. Analysis of weighted centroid-based localization scheme for wireless sensor networks
4. Secure internet of things based hybrid optimization techniques for optimal centroid routing protocol in wireless sensor network;Mudasser A. W.;Concurrency and Computation: Practice and Experience,2023
5. Theory of graphs;Ore O.;American Mathematical Society Colloquium Pubs,1962