{"date_created":"2021-09-10T10:23:07Z","language":[{"iso":"eng"}],"user_id":"66937","_id":"24156","intvolume":" 30","year":"2014","type":"journal_article","page":"275-285","issue":"2","date_updated":"2022-01-06T06:56:08Z","extern":"1","publisher":"Springer","publication":"Graphs and Combinatorics","department":[{"_id":"355"}],"author":[{"full_name":"Basavaraju, Manu","last_name":"Basavaraju","first_name":"Manu"},{"first_name":"L Sunil","last_name":"Chandran","full_name":"Chandran, L Sunil"},{"first_name":"Deepak","full_name":"Rajendraprasad, Deepak","last_name":"Rajendraprasad"},{"last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","id":"66937","first_name":"Arunselvan"}],"volume":30,"title":"Rainbow connection number and radius","status":"public","citation":{"mla":"Basavaraju, Manu, et al. “Rainbow Connection Number and Radius.” Graphs and Combinatorics, vol. 30, no. 2, Springer, 2014, pp. 275–85.","apa":"Basavaraju, M., Chandran, L. S., Rajendraprasad, D., & Ramaswamy, A. (2014). Rainbow connection number and radius. Graphs and Combinatorics, 30(2), 275–285.","short":"M. Basavaraju, L.S. Chandran, D. Rajendraprasad, A. Ramaswamy, Graphs and Combinatorics 30 (2014) 275–285.","chicago":"Basavaraju, Manu, L Sunil Chandran, Deepak Rajendraprasad, and Arunselvan Ramaswamy. “Rainbow Connection Number and Radius.” Graphs and Combinatorics 30, no. 2 (2014): 275–85.","ieee":"M. Basavaraju, L. S. Chandran, D. Rajendraprasad, and A. Ramaswamy, “Rainbow connection number and radius,” Graphs and Combinatorics, vol. 30, no. 2, pp. 275–285, 2014.","bibtex":"@article{Basavaraju_Chandran_Rajendraprasad_Ramaswamy_2014, title={Rainbow connection number and radius}, volume={30}, number={2}, journal={Graphs and Combinatorics}, publisher={Springer}, author={Basavaraju, Manu and Chandran, L Sunil and Rajendraprasad, Deepak and Ramaswamy, Arunselvan}, year={2014}, pages={275–285} }","ama":"Basavaraju M, Chandran LS, Rajendraprasad D, Ramaswamy A. Rainbow connection number and radius. Graphs and Combinatorics. 2014;30(2):275-285."}}