Radio k-labelings for Cartesian products of graphs

DOI10.7151/DMGT.1399zbMath1171.05020OpenAlexW2060681532MaRDI QIDQ3527534

Mustapha Kchikech, Riadh Khennoufa, Olivier Togni

Publication date: 29 September 2008

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

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

zbMATH Keywords

graph theoryCartesian productradio numberantipodal numberradio channel assignmentradio \(k\)-labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (11)

Radio mean labeling of a graph ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ New results on radio \(k\)-labelings of distance graphs ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Antipodal number of some powers of cycles ⋮ Radio k-chromatic number of cycles for large k ⋮ Radio labelings of distance graphs ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ On the radio number for corona of paths and cycles ⋮ Unnamed Item ⋮ Distance-constrained labeling of complete trees

This page was built for publication: Radio k-labelings for Cartesian products of graphs