Radio Secure number of a Graph

Meera, K. N.; Sooryanarayana, B.

doi:10.1016/j.endm.2016.05.023

Cited by 6 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From this there are few new graph labeling techniques which were defined by modifying the definition of existing radio and radio antipodal labeling. One can refer to [2,3,8,15,17,19] for different types of labeling techniques which were originated from radio labeling and radio antipodal labeling.…”

Section: Introductionmentioning

confidence: 99%

On the radio antipodal geometric mean number of ladder related graphs

Giridaran

Jose²,

Jeony³

2022

Malaya J. Mat.

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%