[go: up one dir, main page]

×
An antipodal la- beling of G is a function f that assigns to each vertex a non-negative integer (label) such that for any two ver- tices u and v, |f(u) − f(v)| ≥ d − d(u, v), where d(u, v) is the distance between u and v.
An antipodal labeling of G is a function f that assigns to each vertex a non-negative integer (label) such that for any two vertices u and v, it is satisfied ...
Antipodal Labelings for Cycles · J. Juan, Daphne Der-Fen Liu · Published in Ars Comb. 2012 · Mathematics · Ars Comb.
Nov 8, 2022 · In radio antipodal labeling, the channels were reused again for the antipodal vertices. It will reduce the usage of the number of channels, with ...
A labelling of the n -dimensional hypercube H n is a mapping that assigns value 0 or 1 to each edge of H n . A labelling is antipodal if antipodal edges of ...
Correspondence: gomathisankarasubbu@gmail.com. Abstract: An antipodal labeling is a function f from the vertices of G to the set of natural numbers.
An radio antipodal mean labeling of 𝐺 is a function 𝑓 that assigns to each vertex a non-negative integer such that 𝑓 𝑢 ≠ 𝑓 𝑣 if 𝑑 𝑢, 𝑣 < 𝑑and 𝑑 𝑢, 𝑣 + 𝑓 𝑢 +𝑓(𝑣) ...
A radio antipodal coloring of a connected graph G with diameter d is an assignment of colors (positive integers) to the vertices of G, with x∈V(G) assigned ...
May 6, 2012 · If k = diam ( G ) − 1 , then r c k ( G ) is known as the antipodal number of G . In this paper, we give an upper and a lower bound of ...
An antipodal labeling of G with diameter d is a function f that assigns to each vertex u, a positive integer f(u), such that d(u,v) + |f(u) – f(v)| ≥ d, for all ...