On The Radio Antipodal Mean Number of Certain Types of Ladder Graphs

Yenoke, Kins; T, Arputha Jose; Venugopal, P.

doi:10.15680/ijirset.2020.0906001

Cited by 1 publication

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later graph labeling techniques were also developed to solve this problem. The process of assigning integers to the vertices, edges or to both based on certain condition is known as graph labeling [14]. The first paper on graph labeling was presented by A Rosa in 1966 [18] and up On the radio antipodal geometric mean number of ladder related graphs to till date, there are lot of researches going on graph labeling.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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%

“…[14] The Ladder graph denoted by LG(n), is a graph obtained by the Cartesian product of two path graphs P 2 and P n , n ≥ 2. The n th dimension of a ladder graph has 2n vertices and 3n − 2 edges.…”

mentioning

confidence: 99%