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