Groupoids of homogeneous factorisations of graphs

dc.contributor.authorOkitowamba, Onyumbe
dc.date.accessioned2026-05-22T10:03:50Z
dc.date.available2026-05-22T10:03:50Z
dc.date.issued2009
dc.description.abstractThis thesis is a study on the confluence of algebraic structures and graph theory. Its aim is to consider groupoids from factorisations of complete graphs. We are especially interested in the cases where the factors are isomorphic. We analyse the loops obtained from homogeneous factorisations and ask if homogeneity is reflected in the kind of loops that are obtained. In particular, we are interested to see if we obtain either groups or quasi-associative Cayley sets from these loops. November 2008.
dc.identifier.urihttps://hdl.handle.net/10566/22823
dc.language.isoen
dc.publisherUniversity of the Western Cape
dc.subjectAlgebra
dc.subjectStructures and graph theory
dc.subjectGroupoid graphs
dc.subjectfactorisations
dc.titleGroupoids of homogeneous factorisations of graphs
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
onyumbe_m_nsc_2009.pdf
Size:
651.64 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: