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

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

Show other versions (2)

Philosophiae Doctor - PhD === 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 ce...

Full description

Bibliographic Details
Main Author: Kumwenda, Khumbo
Other Authors: Mwambene, Eric
Language:en
Published: University of the Western Cape 2013
Subjects:
Automorphism groups
Categorical product of graphs
Designs
Graphs
Incidence design
Iterated line graph
Linear code
Neighbourhood design
Permutation decoding
PD-sets
Strong product of graphs
Online Access:http://hdl.handle.net/11394/1760

Internet

http://hdl.handle.net/11394/1760

Similar Items