An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn

DOI10.1016/j.camwa.2010.07.058zbMath1205.05091OpenAlexW1995401759MaRDI QIDQ623146

Pratima Panigrahi, Srinivasa Rao Kola

Publication date: 13 February 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.07.058

zbMATH Keywords

spanradio \(k\)-chromatic numberradio \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

ON RADIO NUMBER OF POWER OF CYCLES ⋮ Radio numbers of some caterpillars ⋮ Antipodal number of some powers of cycles ⋮ A new graph radio k-coloring algorithm ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ Radio numbers of certain \(m\)-distant trees ⋮ Distance-constrained labeling of complete trees ⋮ Radio number for the product of a path and a complete graph

Cites Work

• A survey on radio \(k\)-colorings of graphs
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Radio number for trees
• Radio k-labelings for Cartesian products of graphs
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn