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

DOI10.1016/J.CAMWA.2010.07.058MaRDI QIDQ623146zbMATHOpenAlexFDO

Authors Srinivasa Rao Kola, Pratima Panigrahi

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)

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

Cites work

• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• A note on radio antipodal colourings of paths.
• A survey on radio \(k\)-colorings of graphs
• Antipodal labelings for cycles.
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• 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
• Radio k-labelings for Cartesian products of graphs
• Radio labelings of graphs
• Radio number for trees

Cited in

(15)

• Radio number for the product of a path and a complete graph
• A lower bound for radio \(k\)-chromatic number
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• The radio \(k\)-chromatic number for corona of graphs
• Antipodal number of some powers of cycles
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• A new graph radio \(k\)-coloring algorithm
• Distance-constrained labeling of complete trees
• Improved bounds for some of the radio \(k\)-chromatic numbers of paths
• 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 numbers of some caterpillars
• The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)
• A lower bound technique for radio \(k\)-coloring

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)