State-owned Bank Project Loan Management Problems And Countermeasures

In this paper we deal with the wreath product of permutation groups.While the both factors are the symmetry group of boolean functions,! mainly quote results from other papers in order to giving a full view of wreath product. The main problem is that whether the resulting permutation group is again an automorphism group of a graph,while the both factors are automorphism groups.I define a new binary operation on graphs called orbit composition.When the second factor is transitive,the orbit composition is the same as the composition(see [7;31]).Giving four lemmas,we gain the result that if the both factors are representable by graphs,the wreath of them is also representable.However,when we consider whether the both factors are representable while the wreath is representable by a graph,we don't gain a full answer.We only can know the second factor is representable.Whether the first factor is also representable is still open.