Antipodal radio labelling of full binary trees
type: Item
instance of: scholarly article
title: Antipodal radio labelling of full binary trees
zbMATH Open document ID: 1482.05289
DOI: 10.1007/978-3-030-57602-8_41
author: Satabrata Das
author: Laxman Saha
author: Kalishankar Tiwary
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7367781
zbMATH Keywords: frequency assignment problem
zbMATH Keywords: radio \(k\)-labelling
zbMATH Keywords: radio antipodal number
zbMATH Keywords: span
zbMATH Keywords: tree
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 41
OpenAlex ID: W3047679477
cites work: Radio number of trees
cites work: Radio labelings of graphs
cites work: Q4665539
cites work: Radio antipodal colorings of cycles
cites work: Q4897468
cites work: Multilevel Distance Labelings for Paths and Cycles
cites work: Radio number for trees
cites work: Upper bounds on the radio number of some trees
cites work: Q4650002
cites work: Q3426085
cites work: On the radio number of toroidal grids
cites work: A lower bound for radio \(k\)-chromatic number
cites work: A Graph Radio k-Coloring Algorithm
cites work: On characterizing radio \(k\)-coloring problem by path covering problem
cites work: A lower bound technique for radio \(k\)-coloring
cites work: A channel assignment problem for optical networks modelled by Cayley graphs
cites work: Optimal radio labellings of complete \(m\)-ary trees
description: scientific article; zbMATH DE number 7367781