Improved lower bounds for the radio number of trees

DOI10.1016/J.TCS.2020.05.023zbMath1481.05137OpenAlexW3031831573MaRDI QIDQ2220806

Daphne Der-Fen Liu, Laxman Saha, Satyabrata Das

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.023

zbMATH Keywords

treefrequency assignment problemradio numberspanradio labelling

Mathematics Subject Classification ID

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

Related Items (6)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Radio number for the Cartesian product of two trees ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal radio labellings of complete \(m\)-ary trees
• A distance-labelling problem for hypercubes
• A channel assignment problem for optical networks modelled by Cayley graphs
• Distance-constrained labeling of complete trees
• Radio number for trees
• Radio numbers for generalized prism graphs
• 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: Improved lower bounds for the radio number of trees