The Radio Number of $C_n \square C_n$
From MaRDI portal
Publication:2804820
zbMath1349.05300arXiv1007.5344MaRDI QIDQ2804820
Marc Morris-Rivera, Cindy Wyels, Maggy Tomova, Aaron M. Yeager
Publication date: 4 May 2016
Full work available at URL: https://arxiv.org/abs/1007.5344
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Channel models (including quantum) in information and communication theory (94A40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (15)
Radio-\(k\)-labeling of cycles for large \(k\) ⋮ On the radio number of square of graphs ⋮ Radio graceful Hamming graphs ⋮ Radio number for the Cartesian product of two trees ⋮ A new graph radio k-coloring algorithm ⋮ Optimal radio-\(k\)-labelings of trees ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ On the radio number for corona of paths and cycles ⋮ Radio $k$-labeling of paths ⋮ Unnamed Item ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs
This page was built for publication: The Radio Number of $C_n \square C_n$
