2018-10-24T02:00:44Z
http://ijgt.ui.ac.ir/?_action=export&rf=summon&issue=2411
International Journal of Group Theory
Int. J. Group Theory
2251-7650
2251-7650
2016
5
3
Normal edge-transitive and 12−arc−transitive Cayley graphs on non-abelian groups of order 2pq, p>q are odd primes
Ali Reza
Ashrafi
Bijan
Soleimani
Darafsheh and Assari in [Normal edge-transitive Cayley graphs on non-abelian groups of order 4p, where p is a prime number, Sci. China Math., 56 (1) (2013) 213-219.] classified the connected normal edge transitive and 12−arc-transitive Cayley graph of groups of order 4p. In this paper we continue this work by classifying the connected Cayley graph of groups of order 2pq, p>q are primes. As a consequence it is proved that Cay(G,S) is a 12−arc-transitive Cayley graph of order 2pq, p>q if and only if |S| is an even integer greater than 2, S = T cup T^{-1} and T subseteq { cb^ja^{i} | 0 leq i leq p - 1}, 1 leq j leq q-1, such that T and T^{-1} are orbits of Aut(G,S) and begin{eqnarray*} G &cong& langle a, b, c | a^p = b^q = c^2 = e, ac = ca, bc = cb, b^{-1}ab = a^r rangle, or\ G &cong& langle a, b, c | a^p = b^q = c^2 = e, c ac = a^{-1}, bc = cb, b^{-1}ab = a^r rangle, end{eqnarray*} where r^q equiv 1 (mod p).
Cayley graph
normal edge-transitive
normal arc-transitive
2016
09
01
1
8
http://ijgt.ui.ac.ir/article_6537_5d2a53752a30743d1750e751249611aa.pdf
International Journal of Group Theory
Int. J. Group Theory
2251-7650
2251-7650
2016
5
3
Conjugate p-elements of full support that generate the wreath product Cp≀Cp
David
Ward
For a symmetric group G:=symn">G:=symnG:=symn and a conjugacy class X">XX of involutions in G">GG, it is known that if the class of involutions does not have a unique fixed point, then - with a few small exceptions - given two elements a,x∈X">a,x∈Xa,x∈X, either ⟨a,x⟩">⟨a,x⟩⟨a,x⟩ is isomorphic to the dihedral group D8">D8D8, or there is a further element y∈X">y∈Xy∈X such that ⟨a,y⟩≅⟨x,y⟩≅D8">⟨a,y⟩≅⟨x,y⟩≅D8⟨a,y⟩≅⟨x,y⟩≅D8 (P. Rowley and D. Ward, On π">ππ-Product Involution Graphs in Symmetric Groups. MIMS ePrint, 2014). One natural generalisation of this to p">pp-elements is to consider when two conjugate p">pp-elements generate a wreath product of two cyclic groups of order p">pp. In this paper we give necessary and sufficient conditions for this in the case that our p">pp-elements have full support. These conditions relate to given matrices that are of circulant or permutation type, and corresponding polynomials that represent these matrices. We also consider the case that the elements do not have full support, and see why generalising our results to such elements would not be a natural generalisation.
circulant matrix
cyclic group
wreath product
2016
09
01
9
35
http://ijgt.ui.ac.ir/article_7806_bfc28ccc08ce7146719a30a4144af76b.pdf
International Journal of Group Theory
Int. J. Group Theory
2251-7650
2251-7650
2016
5
3
On the commutativity degree in finite Moufang loops
Karim
Ahmadidelir
The commutativity degree, Pr(G)">Pr(G)Pr(G), of a finite group G">GG (i.e. the probability that two (randomly chosen) elements of G">GGcommute with respect to its operation)) has been studied well by many authors. It is well-known that the best upper bound for Pr(G)">Pr(G)Pr(G) is 58">5858 for a finite non-abelian group G">GG. In this paper, we will define the same concept for a finite non--abelian Moufang loop M">MM and try to give a best upper bound for Pr(M)">Pr(M)Pr(M). We will prove that for a well-known class of finite Moufang loops, named Chein loops, and its modifications, this best upper bound is 2332">23322332. So, our conjecture is that for any finite Moufang loop M">MM, Pr(M)≤2332">Pr(M)≤2332Pr(M)≤2332. Also, we will obtain some results related to the Pr(M)">Pr(M)Pr(M) and ask the similar questions raised and answered in group theory about the relations between the structure of a finite group and its commutativity degree in finite Moufang loops.
Loop theory
Finite Moufang loops
Commutativity degree in finite groups
2016
09
01
37
47
http://ijgt.ui.ac.ir/article_8477_94d05d230f23cf1b5b857c0b3c5bdd37.pdf
International Journal of Group Theory
Int. J. Group Theory
2251-7650
2251-7650
2016
5
3
On groups with specified quotient power graphs
Mostafa
Shaker
Mohammad ali
Iranmanesh
In this paper we study some relations between the power and quotient power graph of a finite group. These interesting relations motivate us to find some graph theoretical properties of the quotient power graph and the proper quotient power graph of a finite group $G$. In addition, we classify those groups whose quotient (proper quotient) power graphs are isomorphic to trees or paths.
Quotient power graph
Fitting subgroup
full exponent
2016
09
01
49
60
http://ijgt.ui.ac.ir/article_8542_509bbaa7e2f6d1914700fada90e92c69.pdf
International Journal of Group Theory
Int. J. Group Theory
2251-7650
2251-7650
2016
5
3
Groups whose proper subgroups of infinite rank have polycyclic-by-finite conjugacy classes
Mounia
Bouchelaghem
Nadir
Trabelsi
A group $G$ is said to be a $(PF)C$-group or to have polycyclic-by-finite conjugacy classes, if $G/C_{G}(x^{G})$ is a polycyclic-by-finite group for all $xin G$. This is a generalization of the familiar property of being an $FC$-group. De Falco et al. (respectively, de Giovanni and Trombetti) studied groups whose proper subgroups of infinite rank have finite (respectively, polycyclic) conjugacy classes. Here we consider groups whose proper subgroups of infinite rank are $(PF)C$-groups and we prove that if $G$ is a group of infinite rank having a non-trivial finite or abelian factor group and if all proper subgroups of $G$ of infinite rank are $(PF)C$-groups, then so is $G$. We prove also that if $G$ is a locally soluble-by-finite group of infinite rank which has no simple homomorphic images of infinite rank and whose proper subgroups of infinite rank are $(PF)C$-groups, then so are all proper subgroups of $G$.
Polycyclic-by-finite conjugacy classes
minimal non-(PF)C-group
minimal non-FC-group
Prüfer rank
2016
09
01
61
67
http://ijgt.ui.ac.ir/article_8776_ca0b92d4179fde3b3ca79f8b4a3ed6ce.pdf