Browsing Department of Mathematical Sciences by Subject "Graphic methods"

Now showing items 1-2 of 2

Identifying vertices in graphs and digraphs

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 ...
Two conjectures on 3-domination critical graphs

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