Journal article
THE RADIO NUMBER OF C-n square C-n
Ars combinatoria, Vol.120, pp.7-21
04/01/2015
Abstract
Radio labeling is a variation of Hale's channel assignment problem, in which one seeks to assign positive integers to the vertices of a graph G subject to certain constraints involving the distances between the vertices. Specifically, a radio labeling of a connected graph G is a function c: V(G) -> Z(+) such that
d(u, v) vertical bar c(u) - c(v)vertical bar >= 1 + diam(G)
for every two distinct vertices u and v of G (where d(u, v) is the distance between u and v). The span of a radio labeling is the maximum integer assigned to a vertex. The radio number of a graph G is the minimum span, taken over all radio labelings of G. This paper establishes the radio number of the Cartesian product of a cycle graph with itself (i.e. of C-n square C-n.)
Details
- Title: Subtitle
- THE RADIO NUMBER OF C-n square C-n
- Creators
- Marc Morris-Rivera - Calif State Univ Sacramento, Dept Math, Sacramento, CA 95819 USAMaggy Tomova - Univ Iowa, Dept Math, Iowa City, IA 52242 USACindy Wyels - Calif State Univ Channel Isl, Dept Math, Camarillo, CA 93012 USAAaron Yeager - Univ Missouri, Dept Math, Columbia, MO 65211 USA
- Resource Type
- Journal article
- Publication Details
- Ars combinatoria, Vol.120, pp.7-21
- Publisher
- CHARLES BABBAGE RES CTR
- ISSN
- 0381-7032
- Number of pages
- 15
- Grant note
- MAA (SUMMA) Research Experience for Undergraduates program - NSF MAA (SUMMA) Research Experience for Undergraduates program - NSA DMS 0302456 / NSF
- Language
- English
- Date published
- 04/01/2015
- Academic Unit
- Mathematics
- Record Identifier
- 9984242317702771
Metrics
11 Record Views