Now showing items 1-10 of 10

  • Automorphism groups of some designs of steiner triple systems and the atomorphism groups of their block intersection graphs 

    Vodah, Sunday (University of the Western Cape, 2014)
    A Steiner triple system of order v is a collection of subsets of size three from a set of v-elements such that every pair of the elements of the set is contained in exactly one 3-subset. In this study, we discuss some ...
  • Codes, graphs and designs from maximal subgroups of alternating groups 

    Mumba, Nephtale Bvalamanja (University of the Western Cape, 2018)
    The main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first examine the binary codes from the row span of biadjacency ...
  • Codes, graphs and designs related to iterated line graphs of complete graphs 

    Kumwenda, Khumbo (University of the Western Cape, 2011)
    In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood ...
  • Codes, graphs and designs related to iterated line graphs of complete graphs 

    Kumwenda, Khumbo (University of the Western Cape, 2011)
    In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1,2. In the binary case, results are extended to codes from ...
  • Graphs of integral distance and their properties 

    Habineza, Olivier (University of Western Cape, 2021)
    Understanding the geometries of points in space has been attractive to mathematicians for ages. As a model, twelve years ago, Kurz and Meyer [32] considered point sets in the m-dimensional a ne space Fmq over a nite ...
  • Groupoids of homogeneous factorisations of graphs 

    Okitowamba, Onyumbe (University of the Western Cape, 2009)
    This 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 ...
  • Measurements of edge uncolourability in cubic graphs 

    Allie, Imran (University of the Western Cape, 2020)
    The history of the pursuit of uncolourable cubic graphs dates back more than a century. This pursuit has evolved from the slow discovery of individual uncolourable cubic graphs such as the famous Petersen graph and the ...
  • Meta-Cayley Graphs on Dihedral Groups 

    Allie, Imran (University of the Western Cape, 2017)
    The pursuit of graphs which are vertex-transitive and non-Cayley on groups has been ongoing for some time. There has long been evidence to suggest that such graphs are a very rarety in occurrence. Much success has been had ...
  • On the primarity of some block intersection graphs 

    Vodah, Sunday (University of the Western Cape, 2018)
    A tactical con guration consists of a nite set V of points, a nite set B of blocks and an incidence relation between them, so that all blocks are incident with the same number k points, and all points are incident with ...
  • Strong simplicity of groups and vertex - transitive graphs 

    Fadhal, Emad Alden Sir Alkhatim Abraham (University of the Western Cape, 2010)
    In the course of exploring various symmetries of vertex-transitive graphs, we introduce the concept of quasi-normal subgroups in groups. This is done since the symmetries of vertex-transitive graphs are intimately linked ...