قمنا في هذا البحث بتحديد زمرة أتومورفيزم بيان كيلي فوق الزمرة حيث p ¹ q عددان أوليان مع مجموعة اتصال كيفية, و ذلك من خلال بناء حلقة شور المولدة بمجموعة الاتصال , ثم تحديد زمرة أتومورفيزم هذه الحلقة و التي هي زمرة أتومورفيزم هذا البيان. و قد قمنا أيضا بتقديم أمثلة على ذلك في نهاية هذا البحث.
In this paper we determine the automorphism group of Cayley graph over the group where p ¹ q are prime numbers, by building the corresponding Schur ring which is generated by Q , and determine the automorphism group of this ring which is the automorphism group of this graph.
References used
M. KLIN; M.MUZYCHUK; R.POSCHEL. The isomorphism problem for circulant graphs via Schur rings theory. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, Vol. 56, 2001, 241-265
KLIN. H. M. Automorphism groups of circulant graphs. Agungsbericht of the conference Applicable Algebra. Oberwolfach, 1993, 1- 12
MUZYCHUK; M, POSCHEL.R. Isomorphism criterion for circulant graphs. Preprint Math, Vol. 9, 1999, 185-217
This study represents the problem of the invariant sub-groups of the
maximal solvable invariant sub-groups in a group GL(q,p), with p and q are
primes, q|(p-١), and its order is r with r/| (P − 1) , as the studying of its
normalizer groups and ide
This papers reports the investigation of extensions of the group by means of the cyclic group A=<a> of order p, where p is a prime number.
It has been concluded from this work that, all non isomorphic extensions of
the group C(n) by means of the group A ,that correspond to irreducible
representations of the group A , are: - p Z
Three organic phosphorous compounds containing bridge
with (PhO) phenoxide and (Ph) phenyl group, to be used as materials derived element
cadmium ion according to the (liquid - liquid) extraction method that apply to widely used
in the restoration
P-NP-problem is the most important issue in computing theory and computational
complexity,Through her study has been defined and studied the ranks of other complexity such
ascoNP, PP, P ..
In this paper we have defined new complexity classes for polynomial time non deterministic
Turing Machine using prime and composite numbers for k-prime numbers.
In this paper ,we study asymptotic properties of solutions of the following
third – order differential equations with -P Laplacian.
In the sequel,it is assumed that all solutions of the equation are
continuously extendable throughout the entire re