@article { author = {Udomworarat, Tanakorn and Suksumran, Teerapong}, title = {An algorithm for finding minimal generating sets of finite groups}, journal = {Algebraic Structures and Their Applications}, volume = {8}, number = {2}, pages = {131-143}, year = {2021}, publisher = {Yazd University}, issn = {2382-9761}, eissn = {2423-3447}, doi = {10.22034/as.2021.2029}, abstract = {In this article, we study connections between components of the Cayley graph $\mathrm{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 $\mathrm{Cay}(G,A)$ has finitely many components. Furthermore, we provide an algorithm for finding minimal generating sets of finite groups using their Cayley graphs.}, keywords = {Cayley graph,Connected graph,Coset,Generating set,Graph component}, url = {https://as.yazd.ac.ir/article_2029.html}, eprint = {https://as.yazd.ac.ir/article_2029_1faa89d54035328fbec3e75bcf9036ae.pdf} }