Abstract
Classical mean labeling of a graph G with p vertices and q edges is an injective function from the vertex set of G to the set {1,2,3, …, q + 1} such that the edge labels obtained from the flooring function of the average of mean of arithmetic, geometric, harmonic, and root square of the vertex labels of each edge’s end vertices is distinct, and the set of edge labels is {1,2,3, …, q}. One of the graph operations is to duplicate the graph. The classical meanness of graphs formed by duplicating an edge and a vertex of numerous standard graphs is discussed in this study.
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 callDisclaimer: 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.
