Optimal radio labellings of complete m-ary trees

DOI10.1016/J.DAM.2009.11.014zbMATH Open1216.05134OpenAlexW2002366650MaRDI QIDQ968168FDOQ968168

Authors: Xiangwen Li, Vicky H. Mak, Sanming Zhou 

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

Recommendations

• Optimal radio-\(k\)-labelings of trees
• Optimal radio labellings of block graphs and line graphs of trees
• Optimal radio labelings of graphs
• Optimal labellings of rooted directed trees
• Linear and cyclic radio k-labelings of trees
• Antipodal radio labelling of full binary trees
• Improved lower bounds for the radio number of trees
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Optimal distance labeling schemes for trees
• Upper bounds on the radio number of some trees

zbMATH Keywords

radio numberbinary treechannel assignment\(m\)-ary treeradio labelling

Mathematics Subject Classification ID

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

Cites Work

• Labelling Graphs with a Condition at Distance 2
• A distance-labelling problem for hypercubes
• Graph labeling and radio channel assignment
• The $L(2,1)$-Labeling Problem on Graphs
• Radio number for trees
• Radio labelings of graphs
• Title not available (Why is that?)
• The radio antipodal and radio numbers of the hypercube.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multilevel Distance Labelings for Paths and Cycles
• Labeling products of complete graphs with a condition at distance two
• The Channel Assignment Problem with Variable Weights
• Real Number Graph Labellings with Distance Conditions
• Distance-two labellings of Hamming graphs
• A channel assignment problem for optical networks modelled by Cayley graphs
• Labelling Cayley Graphs on Abelian Groups

Cited In (27)

• On the radio \(k\)-chromatic number of some classes of trees
• Distance-constrained labeling of complete trees
• On radio number of power of cycles
• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• Further results on the radio number of trees
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• Radio number of trees
• Radio numbers of certain \(m\)-distant trees
• Antipodal radio labelling of full binary trees
• Radio-\(k\)-labeling of cycles for large \(k\)
• 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
• A new graph radio \(k\)-coloring algorithm
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• Radio numbers of some caterpillars
• A lower bound for radio \(k\)-chromatic number
• Radio graceful Hamming graphs
• Antipodal number of some powers of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• Radio number of trees
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• A lower bound technique for radio \(k\)-coloring
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Radio \(k\)-labeling of paths
• Antipodal number of full \(m\)-ary trees

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

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