In this work, new definitions of hypergraph products are presented. The main focus is on the generalization of the commutative standard graph products: the Cartesian, the direct and the strong graph product. We will generalize these well-known graph products to products of hypergraphs and show several properties like associativity, commutativity and distributivity w.r.t. the disjoint union of hypergraphs. Moreover, we show that all defined products of simple (hyper)graphs result in a simple (hyper)graph. We will see, for what kind of product the projections into the factors are (at least weak) homomorphisms and for which products there are similar connections between the hypergraph products as there are for graphs. Last, we give a new and more constructive proof for the uniqueness of prime factorization w.r.t. the Cartesian product than in [Studia Sci. Math. Hungar. 2: 285–290 (1967)] and moreover, a product relation according to such a decomposition. That might help to find efficient algorithms for the decomposition of hypergraphs w.r.t. the Cartesian product.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:16546 |
| Date | 20 October 2017 |
| Creators | Gringmann, Lydia |
| Contributors | Hellmuth, Marc, Universität Leipzig |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English, German |
| Detected Language | English |
| Type | info:eu-repo/semantics/acceptedVersion, doc-type:masterThesis, info:eu-repo/semantics/masterThesis, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:15-qucosa2-163403, qucosa:16340 |
Page generated in 0.0022 seconds