[Paper Review] The Radio Number of Grid Graphs

Tian-Shun Allan Jiang|arXiv (Cornell University)|Jan 25, 2014

Advanced Graph Theory Research14 references3 citations

TL;DR

This paper completely determines the radio number of grid graphs $G_{a,b}$, resolving a long-standing open problem by characterizing five subcases and providing closed-form solutions. It introduces novel techniques for analyzing upper traceable numbers and bumps in grid structures, enabling exact computation of the minimum frequency span required for optimal radio channel assignment in wireless networks.

ABSTRACT

The radio number problem uses a graph-theoretical model to simulate optimal frequency assignments on wireless networks. A radio labeling of a connected graph $G$ is a function $f:V(G) o \mathbb Z_{0}^+$ such that for every pair of vertices $u,v \in V(G)$, we have $\lvert f(u)-f(v) vert \ge ext{diam}(G) + 1 - d(u,v)$ where $ ext{diam}(G)$ denotes the diameter of $G$ and $d(u,v)$ the distance between vertices $u$ and $v$. Let $ ext{span}(f)$ be the difference between the greatest label and least label assigned to $V(G)$. Then, the extit{radio number} of a graph $ ext{rn}(G)$ is defined as the minimum value of $ ext{span}(f)$ over all radio labelings of $G$. So far, there have been few results on the radio number of the grid graph: In 2009 Calles and Gomez gave an upper and lower bound for square grids, and in 2008 Flores and Lewis were unable to completely determine the radio number of the ladder graph (a 2 by $n$ grid). In this paper, we completely determine the radio number of the grid graph $G_{a,b}$ for $a,b>2$, characterizing three subcases of the problem and providing a closed-form solution to each. These results have implications in the optimization of radio frequency assignment in wireless networks such as cell towers and environmental sensors.

Motivation & Objective

• To resolve the open problem of determining the radio number for grid graphs $G_{a,b}$, particularly for $a,b \geq 3$ and the ladder graph $G_{2,b}$.
• To characterize the radio number through five distinct subcases based on grid dimensions and parity.
• To establish a closed-form solution for the radio number of grid graphs, enabling precise frequency assignment in wireless networks.
• To analyze the upper traceable number and bump structure in grid graphs as key components for computing the radio number.
• To provide a complete solution to the radio labeling problem on grid graphs, which had previously only been bounded or partially solved.

Proposed method

• Defines the radio number as the minimum span of a labeling function $f: V(G) \to \mathbb{Z}_0^+$ satisfying $|f(u) - f(v)| \geq \text{diam}(G) + 1 - d(u,v)$ for all $u,v$.
• Introduces the concept of 'bumps' $b_i = f_i - (D+1 - d_i)$ to measure excess label spacing beyond the minimum required by tightness constraints.
• Analyzes the upper traceable number $t^+(G)$ as the maximum sum of consecutive distances $\sum d_i$ in a vertex ordering, crucial for lower bounding the radio number.
• Uses geometric decomposition of the grid into quadrants and medians to derive optimal orderings that maximize $\sum d_i$ under structural constraints.
• Applies a bounding rectangle method to evaluate $d_{\text{rect}}$, showing that $d_{\text{rect}} > \frac{D+1 + b_{k-1} + b_{k-2}}{2}$ implies a $(k-2)$-bump.
• Proves that $(k-3)$-bumps are impossible in grid graphs by contradiction, showing that such configurations would violate the diameter constraint.

Experimental results

Research questions

• RQ1 What is the exact value of the radio number for grid graphs $G_{a,b}$ with $a,b \geq 3$?
• RQ2 How does the radio number of the ladder graph $G_{2,b}$ behave, and can it be fully characterized?
• RQ3 What structural properties of the grid graph determine the maximum possible upper traceable number $t^+(G)$?
• RQ4 Under what conditions do bumps of order $k-2$ occur in a radio labeling of a grid graph?
• RQ5 Can the radio number be expressed as a closed-form function of $a$ and $b$, and how do parity and symmetry affect this?

Key findings

• The radio number of $G_{a,b}$ with $a,b \geq 3$ is completely determined through five subcases based on the parity and relative size of $a$ and $b$.
• For the ladder graph $G_{2,b}$, the paper provides a closed-form expression for the radio number, resolving a previously unresolved case.
• The maximum upper traceable number $t^+(G_{a,b})$ is shown to be $\max(d_x(s)) + \max(d_y(s)) - 1$, achieved by careful vertex ordering avoiding quadrant and median overruns.
• The paper proves that $(k-3)$-bumps cannot occur in grid graphs, as they would violate the diameter constraint $D+1$.
• A $(k-2)$-bump occurs if and only if the bounding rectangle distance $d_{\text{rect}} > \frac{D+1 + b_{k-1} + b_{k-2}}{2}$, providing a geometric criterion for bump detection.
• The radio number is computed as $\text{rn}(G) = (n-1)(D+1) - \left(\max \sum d_i - \min \sum b_i \right)$, with exact values derived for all grid configurations.