The Radio Number of Gear Graphs
| dc.creator | Fernandez, Christina | |
| dc.creator | Flores, América | |
| dc.creator | Tomova, Maggy | |
| dc.creator | Wyels, Cindy | |
| dc.date | 2008-09-15 | |
| dc.date.accessioned | 2026-07-07T10:03:12Z | |
| dc.date.available | 2026-07-07T10:03:12Z | |
| dc.description | Let $d(u,v)$ denote the distance between two distinct vertices of a connected graph $G$, and $\diam(G)$ be the diameter of $G$. A radio labeling $c$ of $G$ is an assignment of positive integers to the vertices of $G$ satisfying $d(u,v)+|c(u)-c(v)|\geq \diam(G) + 1.$ The maximum integer in the range of the labeling is its span. The radio number of $G$, $rn(G)$, is the minimum possible span. The family of gear graphs of order $n$, $G_n$, consists of planar graphs with $2n+1$ vertices and $3n$ edges. We prove that the radio number of the $n$-gear is $4n+2$. | |
| dc.description | 7 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/0809.2623 | |
| dc.identifier | http://arxiv.org/abs/0809.2623 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169202 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C78 (05C15) | |
| dc.title | The Radio Number of Gear Graphs | |
| dc.type | text |