Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/76873Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Tanakorn Udomworarat | en_US |
| dc.contributor.author | Teerapong Suksumran | en_US |
| dc.date.accessioned | 2022-10-16T07:19:34Z | - |
| dc.date.available | 2022-10-16T07:19:34Z | - |
| dc.date.issued | 2021-01-01 | en_US |
| dc.identifier.issn | 24233447 | en_US |
| dc.identifier.other | 2-s2.0-85120804517 | en_US |
| dc.identifier.other | 10.29252/as.2021.2029 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85120804517&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/76873 | - |
| dc.description.abstract | In this article, we study connections between components of the Cayley graph Cay(G,A), where A is an arbitrary subset of a group G, and cosets of the subgroup of G generated by A. In particular, we show how to construct generating sets of G if Cay(G,A) has finitely many components. Furthermore, we provide an algorithm for finding minimal generating sets of finite groups using their Cayley graphs. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | An algorithm for finding minimal generating sets of finite groups<sup>†</sup> | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Algebraic Structures and their Applications | en_US |
| article.volume | 8 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.