{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:04:49Z","timestamp":1775070289938,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,9,8]],"date-time":"2013-09-08T00:00:00Z","timestamp":1378598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00373-013-1355-3","type":"journal-article","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T05:52:39Z","timestamp":1378533159000},"page":"1363-1382","source":"Crossref","is-referenced-by-count":15,"title":["Rainbow Connection Number of Graph Power and Graph Products"],"prefix":"10.1007","volume":"30","author":[{"given":"Manu","family":"Basavaraju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Rajendraprasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arunselvan","family":"Ramaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,8]]},"reference":[{"key":"1355_CR1","doi-asserted-by":"crossref","unstructured":"Basavaraju, M., Sunil Chandran, L., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number and radius. Graphs Comb. (2012). doi: 10.1007\/s00373-012-1267-7","DOI":"10.1007\/s00373-012-1267-7"},{"key":"1355_CR2","doi-asserted-by":"crossref","unstructured":"Caro, Y., Lev, A., Roditty, Y., Tuza, Z., Yuster, R.: On rainbow connection. Electron. J. Combin., 15(1):Research paper 57, 13 (2008)","DOI":"10.37236\/781"},{"key":"1355_CR3","unstructured":"Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3), 330\u2013347 (2011)"},{"issue":"1","key":"1355_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G. Chartrand","year":"2008","unstructured":"Chartrand G., Johns G.L., McKeon K.A., Zhang P.: Rainbow connection in graphs. Math. Bohem. 133(1), 85\u201398 (2008)","journal-title":"Math. Bohem."},{"key":"1355_CR5","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Zhang, P.: Chromatic Graph Theory. Chapman & Hall, London (2008)","DOI":"10.1201\/9781584888017"},{"key":"1355_CR6","doi-asserted-by":"crossref","unstructured":"Gologranc, T., Meki\u0161, G., Peterin, I.: Rainbow connection and graph products. Graphs Comb. (2013). doi: 10.1007\/s00373-013-1295-y","DOI":"10.1007\/s00373-013-1295-y"},{"key":"1355_CR7","unstructured":"Imrich, W., Klav\u017ear, S.: Product graphs: structure and recognition. Wiley, New York (2000)"},{"key":"1355_CR8","doi-asserted-by":"crossref","first-page":"783","DOI":"10.7151\/dmgt.1644","volume":"32","author":"S. Klav\u017ear","year":"2012","unstructured":"Klav\u017ear S., Meki\u0161 G.: On the rainbow connection of cartesian products and their subgraphs. Discuss. Math. Graph Theory 32, 783\u2013793 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"1355_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M. Krivelevich","year":"2010","unstructured":"Krivelevich M., Yuster R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory. 63(3), 185\u2013191 (2010)","journal-title":"J. Graph Theory."},{"issue":"1","key":"1355_CR10","doi-asserted-by":"crossref","first-page":"P20","DOI":"10.37236\/1172","volume":"19","author":"X. Li","year":"2012","unstructured":"Li X., Liu S., Chandran L.S., Mathew R., Rajendraprasad D.: Rainbow connection number and connectivity. Electron. J. Comb. 19(1), P20 (2012)","journal-title":"Electron. J. Comb."},{"key":"1355_CR11","doi-asserted-by":"crossref","unstructured":"Li, X., Shi, Y.: Rainbow connection in 3-connected graphs. Graphs Comb., 1\u20135. doi: 10.1007\/s00373-012-1204-9 (2010)","DOI":"10.1007\/s00373-012-1204-9"},{"key":"1355_CR12","doi-asserted-by":"crossref","unstructured":"Li, X., Sun, Y.: Characterize graphs with rainbow connection number m-2 and rainbow connection numbers of some graph operations (2011)","DOI":"10.1007\/s00373-011-1034-1"},{"key":"1355_CR13","doi-asserted-by":"crossref","unstructured":"Li, X., Sun, Y.: Rainbow connections of graphs. In: Springerbriefs in Mathematics. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-3119-0"},{"issue":"2","key":"1355_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/jgt.20643","volume":"71","author":"L. Sunil Chandran","year":"2012","unstructured":"Sunil Chandran L., Das A., Rajendraprasad D., Varma N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory 71(2), 206\u2013218 (2012)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1355-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1355-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1355-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T17:55:46Z","timestamp":1715968546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1355-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,8]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1355"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1355-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,8]]}}}