Radio labelings of distance graphs
From MaRDI portal
Publication:2446877
DOI10.1016/j.dam.2013.06.024zbMath1287.05131arXiv1207.4219OpenAlexW2032554222MaRDI QIDQ2446877
Olivier Togni, Přemysl Holub, Roman Čada, Jan Ekstein
Publication date: 23 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.4219
Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)
Related Items (7)
Radio and radial radio numbers of certain sunflower extended graphs ⋮ New results on radio \(k\)-labelings of distance graphs ⋮ Further results on the radio number of trees ⋮ On radio \(k\)-labeling of the power of the infinite path ⋮ Radio number for the Cartesian product of two trees ⋮ Radio k-chromatic number of cycles for large k ⋮ Radio number of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Antipodal number of some powers of cycles
- A survey on radio \(k\)-colorings of graphs
- Colouring the real line
- On packing colorings of distance graphs
- Radio number for trees
- Connectivity and diameter in distance graphs
- Radio antipodal colorings of graphs
- Radio numbers for generalized prism graphs
- Radio k-labelings for Cartesian products of graphs
- The upper traceable number of a graph
- Labelling Graphs with a Condition at Distance 2
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Radio k-colorings of paths
- Linear and cyclic radio k-labelings of trees
- Multilevel Distance Labelings for Paths and Cycles
This page was built for publication: Radio labelings of distance graphs