Radio number for the Cartesian product of two trees
From MaRDI portal
Publication:6184339
DOI10.1016/j.dam.2023.09.013arXiv2202.13983MaRDI QIDQ6184339
Daphne Der-Fen Liu, Devsi Bantva
Publication date: 24 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.13983
Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Radio graceful Hamming graphs
- Linear and cyclic distance-three labellings of trees
- 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 labelings of distance graphs
- Radio number for trees
- The Radio Number of $C_n \square C_n$
- The Radio numbers of all graphs of order $n$ and diameter $n-2$
- Radio numbers for generalized prism graphs
- Graph labeling and radio channel assignment
- Multilevel Distance Labelings for Paths and Cycles
- The Channel Assignment Problem with Variable Weights
- Radio number of trees
This page was built for publication: Radio number for the Cartesian product of two trees
