Radio number of trees

DOI10.1016/J.DAM.2016.09.019zbMath1358.05242OpenAlexW2962698506MaRDI QIDQ5892342

Samir Vaidya, Devsi Bantva, Sanming Zhou

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.019

zbMATH Keywords

channel assignmentradio labelingradio number

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ On the radio \(k\)-chromatic number of some classes of trees ⋮ Radio number for the Cartesian product of two trees ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal radio labelling of full binary trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Radio numbers of some caterpillars
• Linear and cyclic distance-three labellings of trees
• Optimal radio labellings of complete \(m\)-ary trees
• Radio number for total graph of paths
• Distance-constrained labeling of complete trees
• Radio labelings of distance graphs
• Radio number for trees
• A survey on labeling graphs with a condition at distance two
• The Radio numbers of all graphs of order $n$ and diameter $n-2$
• Labelling Graphs with a Condition at Distance 2
• Multilevel Distance Labelings for Paths and Cycles
• Radio number of trees

This page was built for publication: Radio number of trees