|
|
|
|
finite bci-groups are solvable
|
|
|
|
|
|
|
|
نویسنده
|
arezoomand majid ,taeri bijan
|
|
منبع
|
international journal of group theory - 2016 - دوره : 5 - شماره : 2 - صفحه:1 -6
|
|
چکیده
|
Let s be a subset of a finite group g. the bi-cayley graph bcay(g,s) of g with respect to s is an undirected graph with vertex set g×{1,2} and edge set {{(x,1),(sx,2)}∣x∈g, s∈s}. a bi-cayley graph bcay(g,s) is called a bci-graph if for any bi-cayley graph bcay(g,t), whenever bcay(g,s)≅bcay(g,t) we have t=gsα for some g∈g and α∈aut(g). a group g is called a bci-group if every bi-cayley graph of gg is a bci-graph. in this paper, we prove that every bci-group is solvable.
|
|
کلیدواژه
|
bi-cayley graph ,graph isomorphism ,solvable group.
|
|
آدرس
|
isfahan university of technology, department of mathematical sciences, ایران, isfahan university of technology, department of mathematical sciences, ایران
|
|
پست الکترونیکی
|
b.taeri@cc.iut.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|