Table of Contents
Journal of Discrete Mathematics
Volume 2014, Article ID 486354, 6 pages
http://dx.doi.org/10.1155/2014/486354
Research Article

Radio Numbers of Certain -Distant Trees

1Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Karnataka 575025, India
2Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur 721302, India

Received 22 August 2014; Revised 30 November 2014; Accepted 3 December 2014; Published 15 December 2014

Academic Editor: Tiziana Calamoneri

Copyright © 2014 Srinivasa Rao Kola and Pratima Panigrahi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. W. K. Hale, “Frequency assignment: theory and applications,” Proceedings of the IEEE, vol. 68, no. 12, pp. 1497–1514, 1980. View at Publisher · View at Google Scholar · View at Scopus
  2. G. Chartrand, D. Erwin, P. Zhang, and F. Harary, “Radio labelings of graphs,” Bulletin of the Institute of Combinatorics and its Applications, vol. 33, pp. 77–85, 2001. View at Google Scholar · View at MathSciNet
  3. G. Chartrand, D. Erwin, and P. Zhang, “A graph labeling problem suggested by FM channel restrictions,” Bulletin of the Institute of Combinatorics and Its Applications, vol. 43, pp. 43–57, 2005. View at Google Scholar · View at MathSciNet
  4. M. Kchikech, R. Khennoufa, and O. Togni, “Linear and cyclic radio k-labelings of trees,” Discussiones Mathematicae. Graph Theory, vol. 27, no. 1, pp. 105–123, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  5. D. D. Liu, “Radio number for trees,” Discrete Mathematics, vol. 308, no. 7, pp. 1153–1164, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. D. Liu and X. Zhu, “Multilevel distance labelings for paths and cycles,” SIAM Journal on Discrete Mathematics, vol. 19, no. 3, pp. 610–621, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. P. Panigrahi, “A survey on radio k-colorings of graphs,” AKCE International Journal of Graphs and Combinatorics, vol. 6, no. 1, pp. 161–169, 2009. View at Google Scholar · View at MathSciNet
  8. S. R. Kola and P. Panigrahi, “Improved lower bound for radio k-chromatic number of hypercube Qn,” Computers and Mathematics with Applications, vol. 60, pp. 2131–2140, 2010. View at Google Scholar
  9. P. Zhang, “Radio labelings of cycles,” Ars Combinatoria, vol. 65, pp. 21–32, 2002. View at Google Scholar · View at MathSciNet · View at Scopus
  10. X. Li, V. Mak, and S. Zhou, “Optimal radio labellings of complete m-ary trees,” Discrete Applied Mathematics, vol. 158, no. 5, pp. 507–515, 2010. View at Publisher · View at Google Scholar