{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T18:49:53Z","timestamp":1777142993427,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T00:00:00Z","timestamp":1449792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00373-015-1665-8","type":"journal-article","created":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T06:48:44Z","timestamp":1449816524000},"page":"1495-1504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["The Rainbow Connection Number of the Power Graph of a Finite Group"],"prefix":"10.1007","volume":"32","author":[{"given":"Xuanlong","family":"Ma","sequence":"first","affiliation":[]},{"given":"Min","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Kaishun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,11]]},"reference":[{"key":"1665_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.5614\/ejgta.2013.1.2.6","volume":"1","author":"J Abawajy","year":"2013","unstructured":"Abawajy, J., Kelarev, A., Chowdhury, M.: Power graphs: a survey. Electron. J. Graph Theory Appl. 1, 125\u2013147 (2013)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"1665_CR2","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1515\/jgt.2010.023","volume":"13","author":"PJ Cameron","year":"2010","unstructured":"Cameron, P.J.: The power graph of a finite group, II. J. Group Theory 13, 779\u2013783 (2010)","journal-title":"J. Group Theory"},{"key":"1665_CR3","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1016\/j.disc.2010.02.011","volume":"311","author":"PJ Cameron","year":"2011","unstructured":"Cameron, P.J., Ghosh, S.: The power graph of a finite group. Discrete Math. 311, 1220\u20131222 (2011)","journal-title":"Discrete Math."},{"key":"1665_CR4","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.disc.2014.03.013","volume":"327","author":"RP Carpentier","year":"2014","unstructured":"Carpentier, R.P., Liu, H., Silva, M., Sousa, T.: Rainbow connection for some families of hypergraphs. Discrete Math. 327, 40\u201350 (2014)","journal-title":"Discrete Math."},{"key":"1665_CR5","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","volume":"21","author":"S Chakraborty","year":"2011","unstructured":"Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connection. J. Comb. Optim. 21, 330\u2013347 (2011)","journal-title":"J. Comb. Optim."},{"key":"1665_CR6","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s00233-008-9132-y","volume":"78","author":"I Chakrabarty","year":"2009","unstructured":"Chakrabarty, I., Ghosh, S., Sen, M.K.: Undirected power graphs of semigroups. Semigroup Forum 78, 410\u2013426 (2009)","journal-title":"Semigroup Forum"},{"key":"1665_CR7","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, 85\u201398 (2008)","journal-title":"Math. Bohem."},{"key":"1665_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.dam.2014.07.018","volume":"179","author":"P Dorbec","year":"2014","unstructured":"Dorbec, P., Schiermeyer, I., Sidorowicz, E., Sopena, \u00c9ric: Rainbow connection in oriented graphs. Discrete Appl. Math. 179, 69\u201378 (2014)","journal-title":"Discrete Appl. Math."},{"key":"1665_CR9","doi-asserted-by":"crossref","first-page":"4975","DOI":"10.12988\/ams.2013.37410","volume":"7","author":"D Estetikasari","year":"2013","unstructured":"Estetikasari, D., Sy, S.: On the rainbow connection for some corona graphs. Appl. Math. Sci. (Ruse) 7, 4975\u20134980 (2013)","journal-title":"Appl. Math. Sci. (Ruse)"},{"key":"1665_CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejc.2014.08.019","volume":"43","author":"M Feng","year":"2015","unstructured":"Feng, M., Ma, X., Wang, K.: The structure and metric dimension of the power graph of a finite group. Eur. J. Comb. 43, 82\u201397 (2015)","journal-title":"Eur. J. Comb."},{"key":"1665_CR11","doi-asserted-by":"crossref","unstructured":"Feng, M., Ma, X., Wang, K.: The full automorphism group of the power (di)graph of a finite group. Eur. J. Comb. 52, 197\u2013206 (2016)","DOI":"10.1016\/j.ejc.2015.10.006"},{"key":"1665_CR12","doi-asserted-by":"crossref","unstructured":"Frieze, A., Tsourakakis, C.E.: Rainbow connection of sparse random graphs. Electron. J. Comb. 19, Paper 5 (2012)","DOI":"10.1007\/978-3-642-32512-0_46"},{"key":"1665_CR13","unstructured":"Frobenius, G.: Verallgemeinerung des Sylow\u2019schen Satzes. Berliner Sitzungsber, Berlin (1895)"},{"key":"1665_CR14","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s00373-013-1295-y","volume":"30","author":"T Gologranc","year":"2014","unstructured":"Gologranc, T., Gas\u0306per, M., Peterin, I.: Rainbow connection and graph products. Graphs Comb. 30, 591\u2013607 (2014)","journal-title":"Graphs Comb."},{"key":"1665_CR15","volume-title":"Finite Groups","author":"D Gorenstein","year":"1980","unstructured":"Gorenstein, D.: Finite Groups. Chelsea Publishing Co., New York (1980)"},{"key":"1665_CR16","first-page":"229","volume":"12","author":"AV Kelarev","year":"2000","unstructured":"Kelarev, A.V., Quinn, S.J.: A combinatorial property and power graphs of groups. Contrib. Gen. Algebra 12, 229\u2013235 (2000)","journal-title":"Contrib. Gen. Algebra"},{"key":"1665_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/jabr.2001.9128","volume":"251","author":"AV Kelarev","year":"2002","unstructured":"Kelarev, A.V., Quinn, S.J.: Directed graph and combinatorial properties of semigroups. J. Algebra 251, 16\u201326 (2002)","journal-title":"J. Algebra"},{"key":"1665_CR18","first-page":"1","volume":"45","author":"AV Kelarev","year":"2004","unstructured":"Kelarev, A.V., Quinn, S.J.: A combinatorial property and power graphs of semigroups. Comment. Math. Uni. Carolinae 45, 1\u20137 (2004)","journal-title":"Comment. Math. Uni. Carolinae"},{"key":"1665_CR19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1017\/S0004972700019390","volume":"63","author":"AV Kelarev","year":"2001","unstructured":"Kelarev, A.V., Quinn, S.J., Smolikova, R.: Power graphs and semigroups of matrices. Bull. Aust. Math. Soc. 63, 341\u2013344 (2001)","journal-title":"Bull. Aust. Math. Soc."},{"key":"1665_CR20","unstructured":"Le, V.B., Tuza, Z.: Finding optimal rainbow connection is hard. Rostock Inst. f\u00fcr Informatik. Preprint (2009)"},{"key":"1665_CR21","doi-asserted-by":"crossref","first-page":"4082","DOI":"10.1016\/j.camwa.2011.09.056","volume":"62","author":"H Li","year":"2011","unstructured":"Li, H., Li, X., Liu, S.: The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Comput. Math. Appl. 62, 4082\u20134088 (2011)","journal-title":"Comput. Math. Appl."},{"key":"1665_CR22","doi-asserted-by":"crossref","first-page":"603","DOI":"10.7151\/dmgt.1692","volume":"33","author":"X Li","year":"2013","unstructured":"Li, X., Liu, M., Schiermeyer, I.: Rainbow connection number of dense graphs. Discuss. Math. Graph Theory 33, 603\u2013611 (2013)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1665_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graphs Comb. 29, 1\u201338 (2013)","journal-title":"Graphs Comb."},{"key":"1665_CR24","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00373-011-1034-1","volume":"28","author":"X Li","year":"2012","unstructured":"Li, X., Sun, Y.: Upper bounds for the rainbow connection numbers of line graphs. Graphs Comb. 28, 251\u2013263 (2012)","journal-title":"Graphs Comb."},{"key":"1665_CR25","doi-asserted-by":"crossref","unstructured":"Ma, X., Feng, M.: On the chromatic number of the power graph of a finite group. Indag. Math. (NS) 26, 626\u2013633 (2015)","DOI":"10.1016\/j.indag.2015.04.003"},{"key":"1665_CR26","doi-asserted-by":"crossref","unstructured":"P\u00f3lya, G., Szeg\u00f6, G.: Problems and theorems in analysis II: theory of functions, zeros, polynomials, determinants, number theory, geometry. Springer, Berlin (1976)","DOI":"10.1007\/978-1-4757-6292-1"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1665-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1665-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1665-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T13:42:26Z","timestamp":1599918146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1665-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,11]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1665"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1665-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,11]]}}}