CHAPTER 2 REVIEW OF RELATED LITERATURE

DOMINATION IN GRAPHS

Let G =(V , E ) be a graph with vertex set V and edge set E. A dominating set ,

denoted DS, of G is a set S of vertices of G such that every vertex in V ∖S is adjacent to

a vertex in S . The domination number of G , denoted by γ(G ) , is the minimum

cardinality of a DS. Atotal dominating set , denoted TDS, of G with no isolated vertex is

a set S of vertices of G such that every vertex is adjacent to a vertex in S . If no proper

subset of S is a TDS of G , thenS is a minimal TDS of G. Every graph without isolated

vertices has a TDS, since S =V is such a set. The total domination number of G ,

denoted by γ t (G ), is the minimum cardinality of a TDS. The upper total domination

number of G, denoted by Γ t (G ), is the maximum cardinality of a minimal TDS.

(Henning, 2009)

History

In 1862, the chess master C.F. de Jaenisch wrote a treatise on the applications of

mathematical analysis to chess in which he considered the number of queens necessary

to attack every square on a n × n chess board. (Dreyer, 2000)

The chessboard domination concept can be extended to graphs in the following

way:
 1. Let G be a graph. A set S ⊆ V is called a dominating set of G if every vertex

u ∈ V\S has a neighbour v ∈ S. Equivalently, every vertex of G is either in S

or in the neighbour set N (S) =⋃v∈S N (v) ofS in G. A vertex u is said to

be dominated by a vertex v∈ G if either u=v or uv∈E (G).

2. A y-set of G is minimum dominating set of G, that is, a dominating set of G

whose cardinality is minimum. A dominating set of S of G is minimal if S

properly contains no dominating set S′of G.

3. The domination number of G is the cardinality of a minimum dominating set

(that is y-set) of G; it is denoted by γ(G). (Balakrishnan & Ranganathan,

2012)

In the late 1950’s and 1960’s, the study of domination in graphs was further

developed, starting with Claude Berge in 1958. Berge wrote a book on graph theory, in

which he introduced the 1 “coefficient of external stability,” which is now known as the

domination number of a graph. (The Medium Domination Number of a Jahangir Graph,

2015)

Oystein Ore introduced the terms “dominating set” and “domination number” in his

book on graph theory which was published in 1962. The problems described above were

studied in more detail around 1964 by brothers Yaglom and Yaglom. Their studies

resulted in solutions to some of these problems for rooks, knights, kings, and bishops. A

decade later, a survey paper, in which the notation γ(G) was first used for the domination

number of a graph G was published by Cockayne and Hedetniemi.

Domination Grid

The domination number of grid graphs has been studied since the 1980s. For the

general case, efforts have been made to obtain lower and upper bounds on γm,n. Studies

of general bounds on γm,n include [2, 4, 6, 7, 10]. Several studies have also been carried

out on specific bounds for small values of (either one or both of) the parameters.. (Alanko,

2011)

Figure 1 Theorems For domination number of grid

(calves, Pinlou, & Thomass´e)

 CHAPTER 3 METHODOLOGY
During the conduct of the study a program made in excel was created so that the

grid and mathematical problem solving process would be standard and that bias would

be avoided. This program solely relies on formulas and functions and no VBA was used.