Linear and cyclic radio k-labelings of trees

DOI10.7151/dmgt.1348zbMath1137.05063OpenAlexW2081868613MaRDI QIDQ5444060

Mustapha Kchikech, Riadh Khennoufa, Olivier Togni

Publication date: 22 February 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1348

zbMATH Keywords

graph theoryradio channel assignmentcyclic and linear radio \(k\)-labeling

Mathematics Subject Classification ID

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

Related Items (15)

ON RADIO NUMBER OF POWER OF CYCLES ⋮ Radio mean labeling of a graph ⋮ Radio numbers of some caterpillars ⋮ New results on radio \(k\)-labelings of distance graphs ⋮ On the radio \(k\)-chromatic number of some classes of trees ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ On radio \(k\)-labeling of the power of the infinite path ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Radio k-chromatic number of cycles for large k ⋮ Unnamed Item ⋮ Radio labelings of distance graphs ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio $k$-labeling of paths ⋮ Radio numbers of certain \(m\)-distant trees ⋮ Multilevel Bandwidth and Radio Labelings of Graphs

This page was built for publication: Linear and cyclic radio k-labelings of trees