Library Portal | UWC Portal | National ETDs | Global ETDs
    • Login
    Contact Us | About Us | FAQs | Login
    View Item 
    •   ETD Home
    • Faculty of Natural Science
    • Department of Mathematics
    • Philosophiae Doctor - PhD (Mathematics)
    • View Item
    •   ETD Home
    • Faculty of Natural Science
    • Department of Mathematics
    • Philosophiae Doctor - PhD (Mathematics)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Codes, graphs and designs related to iterated line graphs of complete graphs

    Thumbnail
    View/Open
    Kumwenda_PHD_2011.pdf (786.1Kb)
    Date
    2011
    Author
    Kumwenda, Khumbo
    Metadata
    Show full item record
    Abstract
    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 designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs Γn that are embeddable into the strong product L1(Kn)⊠  K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, Γn also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of Γn and Hn and determine their parameters.
    URI
    http://hdl.handle.net/11394/1760
    Collections
    • Philosophiae Doctor - PhD (Mathematics)

    Related items

    Showing items related by title, author, creator and subject.

    • Thumbnail

      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 ...
    • Thumbnail

      Investigation of learners’ ways of working with algebraic graphs in high-stakes mathematics examinations 

      Lumbala, Paul Desire Mutombo (University of the Western Cape, 2015-11)
      Algebraic graphs are a difficult topic for most secondary school mathematics learners. My experience as a Mathematics teacher in the Further Education and Training Phase (FET) is that learners solve problems involving ...
    • Thumbnail

      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 ...

    DSpace 6.3 | Ubuntu | Copyright © University of the Western Cape
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Statistics

    View Usage Statistics

    DSpace 6.3 | Ubuntu | Copyright © University of the Western Cape
    Contact Us | Send Feedback
    Theme by 
    @mire NV