Directed Hypergraphs: The Group of Their Composition

Abstract

<p>In this thesis we extend Sabidussi's theorems on the automorphism group of the wreath product of graphs to a special kind of relational systems. That is, we define directed hypergraphs and their wreath product and prove theorems giving necessary and sufficient conditions for the group of the product to be the wreath product of the groups of the components.</p> <p>This also extends our own results on the groups of the wreath products of directed graphs and hypergraphs.</p>