Antipodal radio labelling of full binary trees
From MaRDI portal
Publication:2039697
Recommendations
Cites work
- scientific article; zbMATH DE number 2154968 (Why is no real title available?)
- A channel assignment problem for optical networks modelled by Cayley graphs
- A graph radio \(k\)-coloring algorithm
- A lower bound for radio \(k\)-chromatic number
- A lower bound technique for radio \(k\)-coloring
- A note on radio antipodal colourings of paths.
- Antipodal labelings for cycles.
- Multilevel Distance Labelings for Paths and Cycles
- On characterizing radio \(k\)-coloring problem by path covering problem
- On the radio number of toroidal grids
- Optimal radio labellings of complete \(m\)-ary trees
- Radio antipodal colorings of cycles
- Radio labelings of graphs
- Radio number for trees
- Radio number of trees
- The radio antipodal and radio numbers of the hypercube.
- Upper bounds on the radio number of some trees
Cited in
(6)- Radio \(k\)-chromatic number of full \(m\)-ary trees
- Improved lower bounds for the radio number of trees
- Optimal radio labellings of complete \(m\)-ary trees
- Antipodal number of full \(m\)-ary trees
- The radio and radio antipodal numbers of non-bipartite cubic graphs of order \(2^k\).
- Radio antipodal number of certain graphs
This page was built for publication: Antipodal radio labelling of full binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039697)
