Antipodal radio labelling of full binary trees
From MaRDI portal
Publication:2039697
DOI10.1007/978-3-030-57602-8_41zbMATH Open1482.05289OpenAlexW3047679477MaRDI QIDQ2039697FDOQ2039697
Authors: Satabrata Das, Laxman Saha, Kalishankar Tiwary 
Publication date: 5 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_41
Recommendations
Cites Work
- Radio number for trees
- Radio labelings of graphs
- On the radio number of toroidal grids
- The radio antipodal and radio numbers of the hypercube.
- Title not available (Why is that?)
- A lower bound for radio \(k\)-chromatic number
- Multilevel Distance Labelings for Paths and Cycles
- Optimal radio labellings of complete \(m\)-ary trees
- A note on radio antipodal colourings of paths.
- Radio antipodal colorings of cycles
- On characterizing radio \(k\)-coloring problem by path covering problem
- Antipodal labelings for cycles.
- A lower bound technique for radio \(k\)-coloring
- A channel assignment problem for optical networks modelled by Cayley graphs
- A graph radio \(k\)-coloring algorithm
- Upper bounds on the radio number of some trees
- Radio number of trees
Cited In (6)
- The radio and radio antipodal numbers of non-bipartite cubic graphs of order \(2^k\).
- Improved lower bounds for the radio number of trees
- Optimal radio labellings of complete \(m\)-ary trees
- Radio antipodal number of certain graphs
- Radio \(k\)-chromatic number of full \(m\)-ary trees
- Antipodal number of full \(m\)-ary trees
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)
