Radio number for trees

DOI10.1016/j.disc.2007.03.066zbMath1133.05090OpenAlexW2019349113MaRDI QIDQ2469993

Daphne Der-Fen Liu

Publication date: 11 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.066

zbMATH Keywords

channel assignment problemradio numberdistance-two labelingmulti-level distance labeling

Mathematics Subject Classification ID

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

Related Items (34)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Radio mean labeling of a graph ⋮ Radio numbers of some caterpillars ⋮ Radio secure number of a graph ⋮ 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 ⋮ Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ Further results on the radio number of trees ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Radio number for the Cartesian product of two trees ⋮ Radio k-chromatic number of cycles for large k ⋮ Radio number for total graph of paths ⋮ Radio number of trees ⋮ Radio number of trees ⋮ Radio labelings of distance graphs ⋮ 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 ⋮ \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ 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 number of ladder graphs ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Distance three labellings for K _n ×K ₂ ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs ⋮ Radio number for the product of a path and a complete graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(L(d,1)\)-labelings of graphs
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• The $L(2,1)$-Labeling Problem on Graphs
• Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
• Multilevel Distance Labelings for Paths and Cycles
• Hamiltonicity and circular distance two labellings

This page was built for publication: Radio number for trees