Institutional Repository

Browsing College of Science, Engineering and Technology by Subject "Domination"

Browsing College of Science, Engineering and Technology by Subject "Domination"

Sort by: Order: Results:

  • Grobler, Petrus Jochemus Paulus (1998-11)
    The lower and upper independent, domination and irredundant numbers of the graph G = (V, E) are denoted by i ( G) , f3 ( G), 'Y ( G), r ( G), ir ( G) and IR ( G) respectively. These six numbers are called the domination ...
  • Skaggs, Robert Duane (2009-08-25)
    The closed neighbourhood of a vertex in a graph is the vertex together with the set of adjacent vertices. A di®erentiating-dominating set, or identifying code, is a collection of vertices whose intersection with the ...
  • Burger, Alewyn Petrus (1998-11)
    The queens graph Qn has the squares of then x n chessboard as its vertices; two squares are adjacent if they are in the same row, column or diagonal. A set D of squares of Qn is a dominating set for Qn if every square ...
  • Moodley, Lohini (1999-01)
    For a graph G = (V (G), E (G)), a set S ~ V (G) dominates G if each vertex in V (G) \S is adjacent to a vertex in S. The domination number I (G) (independent domination number i (G)) of G is the minimum cardinality ...

Search UnisaIR


Browse

My Account