Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 326038, 5 pages
http://dx.doi.org/10.1155/2013/326038
Research Article

Radio Number for Total Graph of Paths

1Department of Mathematics, Saurashtra University, Gujarat, Rajkot 360 005, India
2Department of Mathematics, L. E. College, Gujarat, Morvi 363 642, India

Received 31 August 2012; Accepted 27 September 2012

Academic Editors: A. P. Godbole and D. S. Kim

Copyright © 2013 S. K. Vaidya and D. D. Bantva. 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 Google Scholar · View at Scopus
  2. F. S. Roberts, “T-colorings of graphs: recent results and open problems,” Discrete Mathematics, vol. 93, no. 2-3, pp. 229–245, 1991. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. J. R. Griggs and R. K. Yeh, “Labeling graphs with condition at distance 2,” SIAM Journal on Discrete Mathematics, vol. 5, no. 4, pp. 586–595, 1992. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. R. K. Yeh, “A survey on labeling graphs with a condition at distance two,” Discrete Mathematics, vol. 306, no. 12, pp. 1217–1231, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. D. Sakai, “Labeling chordal graphs: distance two condition,” SIAM Journal on Discrete Mathematics, vol. 7, no. 1, pp. 133–140, 1994. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. G. J. Chang and D. Kuo, “The L(2, 1)-labeling problem on graphs,” SIAM Journal on Discrete Mathematics, vol. 9, no. 2, pp. 309–316, 1996. View at Google Scholar · View at Scopus
  7. S. K. Vaidya, P. L. Vihol, N. A. Dani, and D. D. Bantva, “L(2, 1)-labeling in the context of some graph operations,” Journal of Mathematics Research, vol. 2, no. 3, pp. 109–119, 2010. View at Google Scholar
  8. S. K. Vaidya and D. D. Bantva, “Labeling cacti with a condition at distance two,” Le Matematiche, vol. 66, pp. 29–36, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. G. Chartrand, D. Erwinn, F. Harary, and P. Zhang, “Radio labeling of graphs,” Bulletin of the Institute of Combinatorics and Its Applications, vol. 33, pp. 77–85, 2001. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. D. Liu and M. Xie, “Radio number of square cycles,” Congressus Numerantium, vol. 169, pp. 105–125, 2004. View at Google Scholar
  12. D. Liu and M. Xie, “Radio number for square paths,” Ars Combinatoria, vol. 90, pp. 307–319, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. D. Der-Fen Liu, “Radio number for trees,” Discrete Mathematics, vol. 308, no. 7, pp. 1153–1164, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. D. B. West, Introduction To Graph Theory, Prentice-Hall of India, 2001.