Let G(V, E) be a graph with vertex set V and edge set E. A radio geometric mean labeling of a connected graph G is a one to one map from the vertex set V (G) to the set of natural numbers N such that for two distinct vertices u and v, where d(u, v) represents the shortest distance between the vertices u and v and diam(G) represents the diameter of G . Based on the concept of radio geometric mean labeling, a new graph labeling called radio antipodal geometric mean labeling is being introduced in this paper. A radio antipodal geometric mean labeling of a graph G is a mapping from the vertex set V (G) to the set of natural numbers N such that for two distinct vertices u and, then the vertices u and v can be given the same label and if d(u, v) = diam(G) then the vertices u and v should be assigned different labels. The radio antipodal geometric mean number of f , ragmn(f ) is the maximum number assigned to any vertex of G. The radio antipodal geometric mean number of G, ragmn(G) is the minimum value taken over all radio antipodal geometric mean labeling f of G. In this paper, the radio antipodal geometric mean number of certain ladder related graphs have been investigated.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.