AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of G, (J × G) · (1 wr K) is a subgroup of F wr G containing 1 × G (embedded in F wr G), where F wr G denotes the wreath product of G by F. It is shown by construction that there are graphs W and X with automorphism groups F and G, respectively, such that there is a graph product of W and X whose automorphism group is (J × G) · (1 wr K)
Sherpa Romeo green journal: open accessWe generalize a classical result of Sabidussi that was improv...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
Given two groups G and H, then the nonabelian tensor product G ⊗ H is the group generated by g ⨂ h s...
AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of ...
AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose aut...
AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose aut...
AbstractIn 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product ...
AbstractIn this paper we give necessary and sufficient conditions for the group of graph automorphis...
We study the automorphisms of a graph product of finitely generated abelian groups W. More precisely...
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...
AbstractLet A be the collection of groups which can be assembled from infinite cyclic groups using t...
AbstractA theorem of G. Sabidussi (1959, Duke Math. J. 26, 693–696) gives necessary and sufficient c...
AbstractThe present paper proves necessary and sufficient conditions for both lexicographic products...
A theorem of Karrass, Pietrowski and Solitar on the structure of the automorphism group of an amalga...
Sherpa Romeo green journal: open accessWe generalize a classical result of Sabidussi that was improv...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
Given two groups G and H, then the nonabelian tensor product G ⊗ H is the group generated by g ⨂ h s...
AbstractFor any nontrivial finite groups F and G, any subgroup J of F, and any normal subgroup K of ...
AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose aut...
AbstractFrucht [1] gave a method for constructing for each arbitrarily given group a graph whose aut...
AbstractIn 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product ...
AbstractIn this paper we give necessary and sufficient conditions for the group of graph automorphis...
We study the automorphisms of a graph product of finitely generated abelian groups W. More precisely...
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...
AbstractLet A be the collection of groups which can be assembled from infinite cyclic groups using t...
AbstractA theorem of G. Sabidussi (1959, Duke Math. J. 26, 693–696) gives necessary and sufficient c...
AbstractThe present paper proves necessary and sufficient conditions for both lexicographic products...
A theorem of Karrass, Pietrowski and Solitar on the structure of the automorphism group of an amalga...
Sherpa Romeo green journal: open accessWe generalize a classical result of Sabidussi that was improv...
AbstractA given group G may or may not have the property that there exists a graph X such that the a...
Given two groups G and H, then the nonabelian tensor product G ⊗ H is the group generated by g ⨂ h s...