AbstractIt is shown that a permutation group on a finite set is the automorphism group of some directed graph if and only if a generalized Chinese remainder theorem holds for the family of stabilizers. This result can be applied to examine some special permutation groups, including the general linear groups of finite vector spaces
AbstractLet G be a finite group with two transitive permutation representations on the sets Ω1 and Ω...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
Intransitive and imprimitive permutation groups preserve disjoint union decompositions and are routi...
AbstractIt is shown that a permutation group on a finite set is the automorphism group of some direc...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
In [6], Wong defined a quasi-permutation group of degree n to be a finite group G of automorphisms o...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
AbstractThe concrete representation problem asks if a permutation group G on a set X is equal (permu...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
We classify the finite quasisimple groups whose commuting graph is perfect and we give a general str...
AbstractLet G be a finite group with two transitive permutation representations on the sets Ω1 and Ω...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
Intransitive and imprimitive permutation groups preserve disjoint union decompositions and are routi...
AbstractIt is shown that a permutation group on a finite set is the automorphism group of some direc...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
In [6], Wong defined a quasi-permutation group of degree n to be a finite group G of automorphisms o...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
AbstractThe concrete representation problem asks if a permutation group G on a set X is equal (permu...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
We classify the finite quasisimple groups whose commuting graph is perfect and we give a general str...
AbstractLet G be a finite group with two transitive permutation representations on the sets Ω1 and Ω...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
Intransitive and imprimitive permutation groups preserve disjoint union decompositions and are routi...
DOI
Add to ORKG