Determination and Testing the Domination Numbers of Tadpole Graph, Book Graph and Stacked Book Graph Using MATLAB

A set is said to be dominating set of G if for every there exists a vertex such that . The minimum cardinality of vertices among dominating set of G is called the domination number of G denoted by . We investigate the domination number of Tadpole graph, Book graph and Stacked Book graph. Also we test our theoretical results in computer by introducing a matlab procedure to find the domination number , dominating set S and draw this graph that illustrates the vertices of domination this graphs. It is proved that: