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

DOI10.1016/J.CAMWA.2010.07.058zbMATH Open1205.05091OpenAlexW1995401759MaRDI QIDQ623146FDOQ623146

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

Recommendations

• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• A lower bound for radio \(k\)-chromatic number
• Improved bounds for some of the radio \(k\)-chromatic numbers of paths
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• A lower bound technique for radio \(k\)-coloring
• Lower bounds for the chromatic number of certain Kneser-type hypergraphs
• Improved bounds on the chromatic numbers of the square of Kneser graphs
• A new lower bound for the chromatic number of general Kneser hypergraphs
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• A Radio Coloring of a Hypercube

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Radio number for trees
• Radio labelings of graphs
• Title not available (Why is that?)
• Radio k-labelings for Cartesian products of graphs
• Title not available (Why is that?)
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• A survey on radio \(k\)-colorings of graphs
• A note on radio antipodal colourings of paths.
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Radio antipodal colorings of cycles
• Title not available (Why is that?)

Cited In (12)

• Distance-constrained labeling of complete trees
• On radio number of power of cycles
• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• Radio numbers of certain \(m\)-distant trees
• Radio number for the product of a path and a complete graph
• Upper bound for radio -chromatic number of graphs in connection with partition of vertex set
• Radio numbers of some caterpillars
• A lower bound for radio \(k\)-chromatic number
• The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)
• Antipodal number of some powers of cycles
• The radio \(k\)-chromatic number for corona of graphs
• A new graph radio k-coloring algorithm

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

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