Optimal radio labellings of complete \(m\)-ary trees

DOI10.1016/J.DAM.2009.11.014zbMath1216.05134OpenAlexW2002366650MaRDI QIDQ968168

Xiangwen Li, Sanming Zhou, Vicky Mak

Publication date: 5 May 2010

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

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

zbMATH Keywords

binary treechannel assignmentradio number\(m\)-ary treeradio labelling

Mathematics Subject Classification ID

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

Related Items (27)

ON RADIO NUMBER OF POWER OF CYCLES ⋮ Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Radio numbers of some caterpillars ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ On the radio \(k\)-chromatic number of some classes of trees ⋮ Further results on the radio number of trees ⋮ Antipodal number of some powers of cycles ⋮ Radio number of trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio number of trees ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio $k$-labeling of paths ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Radio numbers of certain \(m\)-distant trees ⋮ Antipodal radio labelling of full binary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs

Cites Work

• A distance-labelling problem for hypercubes
• Distance-two labellings of Hamming graphs
• A channel assignment problem for optical networks modelled by Cayley graphs
• Radio number for trees
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Real Number Graph Labellings with Distance Conditions
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• The $L(2,1)$-Labeling Problem on Graphs
• Multilevel Distance Labelings for Paths and Cycles
• Labelling Cayley Graphs on Abelian Groups
• The Channel Assignment Problem with Variable Weights
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal radio labellings of complete \(m\)-ary trees