[HTML][HTML] Radio number of trees
A radio labeling of a graph G is a mapping f: V (G)→{0, 1, 2,…} such that| f (u)− f (v)|≥ diam
(G)+ 1− d (u, v) for every pair of distinct vertices u, v of G, where diam (G) is the diameter of G …
(G)+ 1− d (u, v) for every pair of distinct vertices u, v of G, where diam (G) is the diameter of G …
Distance labellings of Cayley graphs of semigroups
A Kelarev, C Ras, S Zhou - Semigroup Forum, 2015 - Springer
This paper establishes connections between the structure of a semigroup and the minimum
spans of distance labellings of its Cayley graphs. We show that certain general restrictions …
spans of distance labellings of its Cayley graphs. We show that certain general restrictions …
Radio number of trees
A radio labeling of a graph G is a mapping f: V (G)→{0, 1, 2,…} such that| f (u)− f (v)|≥ d+ 1−
d (u, v) for every pair of distinct vertices u, v of G, where d and d (u, v) are the diameter of G …
d (u, v) for every pair of distinct vertices u, v of G, where d and d (u, v) are the diameter of G …
Distance-constrained labellings of Cartesian products of graphs
Abstract An L (h 1, h 2,…, hl)-labelling of a graph G is a mapping ϕ: V (G)→{0, 1, 2,…} such
that for 1≤ i≤ l and each pair of vertices u, v of G at distance i, we have| ϕ (u)− ϕ (v)|≥ h i …
that for 1≤ i≤ l and each pair of vertices u, v of G at distance i, we have| ϕ (u)− ϕ (v)|≥ h i …