{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:43:11Z","timestamp":1776858191184,"version":"3.51.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R014604\/1"],"award-info":[{"award-number":["EP\/R014604\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>G<\/jats:italic> be a group. The power graph of <jats:italic>G<\/jats:italic> is a graph with vertex set <jats:italic>G<\/jats:italic> in which two distinct elements <jats:italic>x<\/jats:italic>,\u00a0<jats:italic>y<\/jats:italic> are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence number, show that they have clique cover number equal to their independence number, and calculate this number. The proper power graph is the induced subgraph of the power graph on the set <jats:inline-formula><jats:alternatives><jats:tex-math>$$G-\\{1\\}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>G<\/mml:mi><mml:mo>-<\/mml:mo><mml:mo>{<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>}<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. A group whose proper power graph is connected must be either a torsion group or a torsion-free group; we give characterizations of some groups whose proper power graphs are connected.<\/jats:p>","DOI":"10.1007\/s00373-020-02162-z","type":"journal-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T17:03:13Z","timestamp":1585674193000},"page":"895-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["On the Connectivity and Independence Number of Power Graphs of Groups"],"prefix":"10.1007","volume":"36","author":[{"given":"Peter J.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayyed Heidar","family":"Jafari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,31]]},"reference":[{"key":"2162_CR1","doi-asserted-by":"crossref","unstructured":"Aalipour, G., Akbari, S., Cameron, P. J., Nikandish, R., Shaveisi, F.: On the structure of the power graph and the enhanced power graph of a group. Electron. J. Combin.24(3), paper 3.16 (2017)","DOI":"10.37236\/6497"},{"issue":"2","key":"2162_CR2","doi-asserted-by":"publisher","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(2), 125\u2013147 (2013)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"2162_CR3","first-page":"459","volume":"35","author":"SI Adian","year":"1971","unstructured":"Adian, S.I.: On some torsion-free groups. Izv. Akad. Nauk SSSR Ser. Mat. 35, 459\u2013468 (1971)","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat."},{"key":"2162_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10801-018-0819-1","volume":"49","author":"PJ Cameron","year":"2019","unstructured":"Cameron, P.J., Guerra, H., Jurina, \u0160.: The power graph of a torsion-free group. J. Algebr. Combin. 49, 83\u201398 (2019)","journal-title":"J. Algebr. Combin."},{"issue":"3","key":"2162_CR5","doi-asserted-by":"publisher","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(3), 410\u2013426 (2009)","journal-title":"Semigroup Forum"},{"key":"2162_CR6","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1016\/j.jcta.2013.05.008","volume":"120","author":"M Giudici","year":"2013","unstructured":"Giudici, M., Parker, C.: There is no upper bound for the diameter of the commuting graph of a finite group. J. Combin. Theory (A) 120, 1600\u20131603 (2013)","journal-title":"J. Combin. Theory (A)"},{"key":"2162_CR7","volume-title":"The Theory of Groups","author":"M Hall Jr","year":"1959","unstructured":"Hall Jr., M.: The Theory of Groups. Macmillan, New York (1959)"},{"key":"2162_CR8","unstructured":"Jafari, S.H.: Some results in a new power graphs in finite groups. Util. Math. (to appear)"},{"key":"2162_CR9","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Computational P\u00f3lya theory. In: Rowlinson, P. (ed.) Surveys in Combinatorics 1995, London Mathematical Society Lecture Note Series, vol. 218. Cambridge University Press, Cambridge, pp. 103\u2013118 (1995)","DOI":"10.1017\/CBO9780511662096.006"},{"key":"2162_CR10","unstructured":"Kelarev, A.V., Quinn, S.J.: A Combinatorial Property and Power Graphs of Groups, Contributions to General Algebra, vol. 12 (Vienna, 1999). Heyn, Klagenfurt, pp. 229\u2013235 (2000)"},{"key":"2162_CR11","doi-asserted-by":"publisher","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."},{"issue":"3","key":"2162_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2(3), 253\u2013267 (1972)","journal-title":"Discrete Math."},{"key":"2162_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"#cr-split#-2162_CR14.1","unstructured":"Margulis, G.A.: Explicit construction of concentrators. Prob. Per. Infor. 9, 71-80 (1973) (in Russian)"},{"key":"#cr-split#-2162_CR14.2","unstructured":"English translation: Probl. Inf. Trans. (1975), 325-332"},{"key":"2162_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jalgebra.2013.06.031","volume":"393","author":"GL Morgan","year":"2013","unstructured":"Morgan, G.L., Parker, C.W.: The diameter of the commuting graph of a finite group with trivial centre. J. Algebra 393, 41\u201359 (2013)","journal-title":"J. Algebra"},{"key":"2162_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1006\/jabr.1997.7185","volume":"199","author":"VN Obraztsov","year":"1998","unstructured":"Obraztsov, V.N.: Simple torsion-free groups in which the intersection of any two non-trivial subgroups is non-trivial. J. Algebra 199, 337\u2013343 (1998)","journal-title":"J. Algebra"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02162-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02162-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02162-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T23:27:09Z","timestamp":1617146829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02162-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,31]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2162"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02162-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,31]]},"assertion":[{"value":"15 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}