Improved bounds for radio k-chromatic number of hypercube Q_n

DOI10.1155/2011/961649MaRDI QIDQ539413zbMATH OpenOpenAlexWikidataFDO

Authors Laxman Saha, Pratima Panigrahi, Pawan Kumar

Publication date 27 May 2011

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2011/961649

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Review text

Summary: A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels (nonnegative integers) to the stations in an optimal way such that interference is avoided as reported by Hale (2005). Radio \(k\)-coloring of a graph is a special type of channel assignment problem. Kchikech et al. (2005) have given a lower and an upper bound for radio \(k\)-chromatic number of hypercube \(Q_n\), and an improvement of their lower bound was obtained by Kola and Panigrahi (2010). In this paper, we further improve Kola et al.'s lower bound as well as Kchikeck et al.'s upper bound. Also, our bounds agree for nearly antipodal number of \(Q_n\) when \( \equiv 2\) (mod 4).

Recommendations

• An improved lower bound for the radio k-chromatic number of the hypercube qn
• A lower bound for radio \(k\)-chromatic number
• On the radio number of square of graphs
• A Radio Coloring of a Hypercube
• On radio number of power of cycles

Cites work

• A note on radio antipodal colourings of paths.
• An improved lower bound for the radio k-chromatic number of the hypercube qn
• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• 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\)
• Optimal radio labellings of complete m-ary trees
• Radio k-Labelings for Cartesian Products of Graphs
• The radio antipodal and radio numbers of the hypercube.

Cited in

(3)

• On radio number of power of cycles
• A Radio Coloring of a Hypercube
• An improved lower bound for the radio k-chromatic number of the hypercube qn

This page was built for publication: Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)

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