The radio number of C_n C_n.

zbMATH Open1349.05300arXiv1007.5344MaRDI QIDQ2804820FDOQ2804820

Authors: Marc Morris-Rivera, Maggy Tomova, Cindy Wyels, Aaron M. Yeager 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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)ightarrowmathbb{Z}_{+}$ such that ${\displaystyle }$d(u,v)+|c(u)-c(v)|geq 1+ ext{diam}(G)${\displaystyle }$ 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$.)

Full work available at URL: https://arxiv.org/abs/1007.5344

Recommendations

• scientific article; zbMATH DE number 2188457
• scientific article; zbMATH DE number 2170463
• scientific article; zbMATH DE number 2154968
• Radio labeling of cube of a cycle
• Radio labelings of graphs

zbMATH Keywords

cycleradio labelingradio numberCartesian product

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Cited In (24)

• Distance-constrained labeling of complete trees
• Radio labelings of graphs
• On the radio number of toroidal grids
• On radio number of power of cycles
• \(K_n\square P\) is radio graceful
• Radio k-labelings for Cartesian products of graphs
• Radio-\(k\)-labeling of cycles for large \(k\)
• Optimal radio-\(k\)-labelings of trees
• Optimal radio labellings of block graphs and line graphs of trees
• A new graph radio \(k\)-coloring algorithm
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• Radio number for the Cartesian product of two trees
• Title not available (Why is that?)
• On the radio number of square of graphs
• A lower bound for radio \(k\)-chromatic number
• The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)
• Radio graceful Hamming graphs
• The radio \(k\)-chromatic number for corona of graphs
• Radio number of 1, 2 - Cartesian product of paths
• On the radio number for corona of paths and cycles
• Radio k-Labelings for Cartesian Products of Graphs
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Radio \(k\)-labeling of paths
• Antipodal number of full \(m\)-ary trees

This page was built for publication: The radio number of \(C_n\square C_n\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804820)