UJDigispace Repository

Lattices of graph properties

Show simple item record

dc.contributor.advisor Prof. I. Broere en_US
dc.contributor.author Moagi, Samuel John Teboho
dc.date.accessioned 2012-09-11T10:15:25Z
dc.date.available 2012-09-11T10:15:25Z
dc.date.issued 2012-09-11
dc.date.submitted 1998
dc.identifier.uri http://hdl.handle.net/10210/7459
dc.description M.Sc. en_US
dc.description.abstract In this work we will need the basic knowledge of Graph Theory as our background and as we go along we will state and prove some of the Lattice and Set Theory results. Every graph in this work is considered as a finite simple graph, in other words, it is finite, undirected, loopless and without multiple edges. The class of all finite simple graphs will be denoted by I. If G is graph in I, we use the notation V(G) to denote the set of all vertices in G and the notation E(G) to denote the set of all the edges in G. en_US
dc.language.iso en en_US
dc.subject Graph theory en_US
dc.subject Graph theory - Problems, exercises, etc en_US
dc.title Lattices of graph properties en_US
dc.type Mini-Dissertation en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UJDigispace


My Account