Radio-\(k\)-labeling of cycles for large \(k\)
From MaRDI portal
Publication:2143046
DOI10.1016/J.DAM.2022.03.020zbMath1491.05160arXiv2106.15059OpenAlexW3174569836MaRDI QIDQ2143046
Daphne Der-Fen Liu, Colin Bloomfield, Jeannette Ramirez
Publication date: 30 May 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.15059
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Radio graceful Hamming graphs
- Optimal radio labellings of complete \(m\)-ary trees
- A distance-labelling problem for hypercubes
- A channel assignment problem for optical networks modelled by Cayley graphs
- Improved lower bounds for the radio number of trees
- Optimal radio-\(k\)-labelings of trees
- Optimal radio labellings of block graphs and line graphs of trees
- Distance-constrained labeling of complete trees
- Radio number for trees
- The Radio Number of $C_n \square C_n$
- Radio numbers for generalized prism graphs
- Labelling Graphs with a Condition at Distance 2
- Radio k-chromatic number of cycles for large k
- Multilevel Distance Labelings for Paths and Cycles
- Labelling Cayley Graphs on Abelian Groups
- Radio number of trees
This page was built for publication: Radio-\(k\)-labeling of cycles for large \(k\)