Files in this item
Matching in power graphs of finite groups
Item metadata
dc.contributor.author | Cameron, Peter J. | |
dc.contributor.author | Swathi, V. V. | |
dc.contributor.author | Sunitha, M. S. | |
dc.date.accessioned | 2022-03-21T13:30:12Z | |
dc.date.available | 2022-03-21T13:30:12Z | |
dc.date.issued | 2022-06 | |
dc.identifier | 277928698 | |
dc.identifier | a542397d-fe44-4388-8998-00192143c05b | |
dc.identifier | 85126100803 | |
dc.identifier | 000769631900001 | |
dc.identifier.citation | Cameron , P J , Swathi , V V & Sunitha , M S 2022 , ' Matching in power graphs of finite groups ' , Annals of Combinatorics , vol. 26 , no. 2 , pp. 379-391 . https://doi.org/10.1007/s00026-022-00576-5 | en |
dc.identifier.issn | 0218-0006 | |
dc.identifier.other | ORCID: /0000-0003-3130-9505/work/110131558 | |
dc.identifier.uri | https://hdl.handle.net/10023/25072 | |
dc.description | Funding: The author Swathi V V acknowledges the support of Council of Scientific and Industrial Research, India (CSIR) (Grant No-09/874(0029)/2018-EMR-I), and DST, Government of India, ‘FIST’ (No.SR/FST /MS-I/2019/40). | en |
dc.description.abstract | The power graph P(G) of a finite group G is the undirected simple graph with vertex set G, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are investigated. We give upper and lower bounds, and conditions for the power graph of a group to possess a perfect matching. We give a formula for the matching number for any finite nilpotent group. In addition, using some elementary number theory, we show that the matching number of the enhanced power graph Pe(G) of G (in which two elements are adjacent if both are powers of a common element) is equal to that of the power graph of G. | |
dc.format.extent | 326779 | |
dc.language.iso | eng | |
dc.relation.ispartof | Annals of Combinatorics | en |
dc.subject | Group | en |
dc.subject | Power graph | en |
dc.subject | Matching | en |
dc.subject | Enhanced power graph | en |
dc.subject | Perfect matching | en |
dc.subject | QA Mathematics | en |
dc.subject | Mathematics(all) | en |
dc.subject | T-DAS | en |
dc.subject.lcc | QA | en |
dc.title | Matching in power graphs of finite groups | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1007/s00026-022-00576-5 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://arxiv.org/abs/2107.01157v1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.