|
|
|
|
an algorithm for finding minimal generating sets of finite groups
|
|
|
|
|
|
|
|
نویسنده
|
suksumran teerapong ,udomworarat tanakorn
|
|
منبع
|
journal of algebraic structures and their applications - 2021 - دوره : 8 - شماره : 2 - صفحه:131 -143
|
|
چکیده
|
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.
|
|
کلیدواژه
|
cayley graph ,connected graph ,coset ,generating set ,graph component.
|
|
آدرس
|
chiang mai university, faculty of science, department of mathematics, thailand, chiang mai university, faculty of science, department of mathematics, thailand
|
|
پست الکترونیکی
|
tanakorn_u@cmu.ac.th
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|