Optimal radio-k-labelings of trees

DOI10.1016/J.EJC.2020.103203MaRDI QIDQ2225407zbMATH OpenOpenAlexFDO

Authors Angel Chavez, Daphne Der-Fen Liu, Mason Shurman

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)

Recommendations

• Radio number of trees
• Radio number of trees
• Improved lower bounds for the radio number of trees
• Upper bounds on the radio number of some trees
• Linear and cyclic radio k-labelings of trees

Cites work

• A note on radio antipodal colourings of paths.
• Distance-constrained labeling of complete trees
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• Multilevel Distance Labelings for Paths and Cycles
• On the radio number of toroidal grids
• Optimal radio labellings of complete m-ary trees
• Radio graceful Hamming graphs
• Radio number for trees
• Radio number of trees
• Radio numbers for generalized prism graphs
• The radio antipodal and radio numbers of the hypercube.
• The radio number of \(C_n\square C_n\).

Cited in

(12)

• Antipodal number of full \(m\)-ary trees
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Radio-\(k\)-labeling of cycles for large \(k\)
• New results on radio \(k\)-labelings of distance graphs
• Improved lower bounds for the radio number of trees
• Optimal radio labellings of block graphs and line graphs of trees
• Linear and cyclic radio k-labelings of trees
• Multilevel Bandwidth and Radio Labelings of Graphs
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• Radio number for the Cartesian product of two trees
• A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements
• Optimal radio labellings of complete m-ary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225407)