English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let G = (V, E) be a graph and diam(G) be the diameter of the G. Let u, v ∈ V(G). The radio antipodal mean labelling of graph G is a function f that assigns to each vertex u, a non-negative integer f(u) such that f(u) ≠ f(v) if d(u, v) < diam(G) and d(u, v) + ⌈f(u)+f(v) 2 ⌉ ≥ diam G , where d(u, v) represents the shortest distance between any pair of vertices u and v of G. The antipodal mean number of f, denoted by ramn(f) is the maximum number assigned to any vertex of G and is denoted by amn(G). The antipodal mean number of G, denoted by ramn(G) is the minimum value of ramn(f) taken over all antipodal mean labeling f of G. In this paper, the radio antipodal mean number for certain ladder-related graphs Mongolian tent graph, Triangular ladder graph and Pagoda graphs were obtained.

international journal of innovative research in science engineering and technology/international journal of innovative research in science, engineering and technology

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