Radio graceful Hamming graphs
From MaRDI portal
Publication:339492
DOI10.7151/dmgt.1910zbMath1350.05149OpenAlexW2462730919MaRDI QIDQ339492
Publication date: 11 November 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1910
Related Items (5)
Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Radio number for the Cartesian product of two trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Unnamed Item
Cites Work
- Antipodal number of some powers of cycles
- A lower bound for radio \(k\)-chromatic number
- Optimal radio labellings of complete \(m\)-ary trees
- No-hole \(L(2,1)\)-colorings
- Radio number for trees
- A survey on labeling graphs with a condition at distance two
- 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
- Full Color Theorems for L(2,1)-Colorings
- The radio number of (Wn: 2) graphs
- Labelling Graphs with a Condition at Distance 2
- Multilevel Distance Labelings for Paths and Cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Radio graceful Hamming graphs
