A classification of nonabelian simple 3-BCI-groups

作者：Jin, Wei; Liu, Weijun^*

来源：European Journal of Combinatorics, 2010, 31(5): 1257-1264.

DOI：10.1016/j.ejc.2009.11.003

• CAYLEY-GRAPHS
• ORDER
• ISOMORPHISMS

For a finite group G and a subset S subset of G (possibly, S contains the identity of G), the bi-Cayley graph BCay(G, S) of G with respect to S is the graph with vertex set G x {0, 1} and with edge set {(chi, 0), (s chi x, 1)vertical bar chi is an element of G, s is an element of 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) congruent to BCay(G, T) we have T = gS(alpha), for some g is an element of G, alpha is an element of Aut(G). A group G is called an m-BCI-group, if all bi-Cayley graphs of G of valency at most M are BCI-graphs. In this paper, we prove that a finite nonabelian simple group is a 3-BCI-group if and only if it is A(5).

• 出版日期2010-7
• 单位中南大学; 南通大学