Optimal radio-\(k\)-labelings of trees

DOI10.1016/j.ejc.2020.103203zbMath1458.05229OpenAlexW3082270022MaRDI QIDQ2225407

Mason Shurman, Angel Chavez, Daphne Der-Fen Liu

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103203

zbMATH Keywords

\(k\)-lower bound treeradio number of a graph

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Relationship between radio k-chromatic number of graphs and square graphs

Cites Work

• Radio graceful Hamming graphs
• Optimal radio labellings of complete \(m\)-ary trees
• Distance-constrained labeling of complete trees
• Radio number for trees
• The Radio Number of $C_n \square C_n$
• Radio numbers for generalized prism graphs
• Multilevel Distance Labelings for Paths and Cycles
• Radio number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal radio-\(k\)-labelings of trees