Abstract

A function f is called an F-centroidal mean labeling of a graph G(V, E) with p vertices and q edges if f : V(G) → {1, 2, 3, …, q + 1} is injective and the induced function g* : E(G) →{1, 2, 3, …, q} defined as for all , is bijective. A graph that admits an F-centroidal mean labeling is called an F-centroidal mean graph. The line graph is one among the graph operations. In this paper, we try to analyse that the line graph operation preserves the F-centroidal mean property for the path Pn , the cycle Cn , the star graph Sn , the complete graph Kn , the graph Pn o S 1, the triangular snake graph Tn and the arbitrary subdivision of S 3.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.