AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose automorphism group is isomorphic to the prescribed group. Constructions of “product” graphs whose automorphism groups are given subgroups of the wreath product of two groups are given. For S2 wr G, comprehensive results are given for all subgroups of S2 wr G containing 1 × G. A concept of graph product which is a generalization of Imrich's definition [2] is employed
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
AbstractWe prove that if p is a prime and W is the standard wreath product of two nontrivial cyclic ...
AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose aut...
AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of ...
AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of ...
AbstractA theorem of G. Sabidussi (1959, Duke Math. J. 26, 693–696) gives necessary and sufficient c...
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
AbstractIn this paper we give necessary and sufficient conditions for the group of graph automorphis...
AbstractIn 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product ...
We study the automorphisms of a graph product of finitely generated abelian groups W. More precisely...
Sherpa Romeo green journal: open accessWe generalize a classical result of Sabidussi that was improv...
This project is a combination of graphs and group theory in which the aim is to describe the automor...
AbstractA theorem of G. Sabidussi (1959, Duke Math. J. 26, 693–696) gives necessary and sufficient c...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
AbstractWe prove that if p is a prime and W is the standard wreath product of two nontrivial cyclic ...
AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose aut...
AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of ...
AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of ...
AbstractA theorem of G. Sabidussi (1959, Duke Math. J. 26, 693–696) gives necessary and sufficient c...
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
AbstractIn this paper we give necessary and sufficient conditions for the group of graph automorphis...
AbstractIn 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product ...
We study the automorphisms of a graph product of finitely generated abelian groups W. More precisely...
Sherpa Romeo green journal: open accessWe generalize a classical result of Sabidussi that was improv...
This project is a combination of graphs and group theory in which the aim is to describe the automor...
AbstractA theorem of G. Sabidussi (1959, Duke Math. J. 26, 693–696) gives necessary and sufficient c...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
We give necessary and sufficient conditions for the automorphism group of the wreath product of dire...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
AbstractWe prove that if p is a prime and W is the standard wreath product of two nontrivial cyclic ...