An algorithm for finding minimal generating sets of finite groups

DOI10.29252/as.2021.2029zbMath1499.05299arXiv2009.05922MaRDI QIDQ5076993

Teerapong Suksumran, Tanakorn Udomworarat

Publication date: 17 May 2022

Full work available at URL: https://arxiv.org/abs/2009.05922

zbMATH Keywords

Cayley graphconnected graphgenerating setcosetgraph component

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The largest size of a minimal generating set of a finite group.
• Approaching the Moore bound for diameter two by Cayley graphs
• Some problems on Cayley graphs
• On Cayley graphs of rectangular groups
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• On transitive Cayley graphs of strong semilattices of right (left) groups
• Cayley graphs as models of deterministic small-world networks
• Connectivity of minimal Cayley graphs
• Computing a set of generators of minimal cardinality in a solvable group
• On isomorphisms of finite Cayley graphs---a survey
• A combinatorial property and Cayley graphs of semigroups
• On transitive Cayley graphs of groups and semigroups
• Some properties of unitary Cayley graphs
• On Cayley graphs of inverse semigroups.
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• On the Automorphism Groups of Cayley Graphs of Finite Simple Groups
• Generating sets of finite groups
• Minimal generating sets of groups, rings, and fields
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

This page was built for publication: An algorithm for finding minimal generating sets of finite groups