Radio graceful Hamming graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2044507 (Why is no real title available?)
- scientific article; zbMATH DE number 2170463 (Why is no real title available?)
- A lower bound for radio \(k\)-chromatic number
- A survey on labeling graphs with a condition at distance two
- Antipodal number of some powers of cycles
- Full Color Theorems for L(2,1)-Colorings
- Labelling Graphs with a Condition at Distance 2
- Multilevel Distance Labelings for Paths and Cycles
- No-hole \(L(2,1)\)-colorings
- On the radio number of toroidal grids
- Optimal radio labellings of complete m-ary trees
- Radio labeling of cube of a cycle
- Radio labelings of graphs
- Radio number for trees
- Radio numbers for generalized prism graphs
- The radio number of (Wn: 2) graphs
- The radio number of \(C_n\square C_n\).
- The radio numbers of all graphs of order \(n\) and diameter \(n-2\)
Cited in
(8)- Radio number of Hamming graphs of diameter 3
- \(K_n\square P\) is radio graceful
- scientific article; zbMATH DE number 6511294 (Why is no real title available?)
- Radio-\(k\)-labeling of cycles for large \(k\)
- Optimal radio-\(k\)-labelings of trees
- Optimal radio labellings of block graphs and line graphs of trees
- Radio number for the Cartesian product of two trees
- On radio graceful Hamming graphs of any diameter
This page was built for publication: Radio graceful Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339492)