Achieving All Radio Numbers

Ben Sokolowsky, Joseph A. Gallian · AKCE International Journal of Graphs and Combinatorics · 2020

For a connected graph G, a radio labeling is a function c: V(G) → ℤ+ such that for every pair of vertices (u, v) in V(G), the radio condition is satisfied: The span of a radio labeling c is the lar...

Read the paper · More papers on PaperTik