Reflection of Duplicating Operations in the Graphs P n and P n ∘ K 1 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 th...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematics (Hidawi) 2024-01, Vol.2024 (1)
Main Authors: Kannan, A. Rajesh, Loganathan, K., Usha, P., Pattanaik, Balachandra
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2314-4629
2314-4785
DOI:10.1155/2024/2691033