الملخص

Abstract A set is dominating set of a graph G, if every vertex in V-S is adjacent to at least one vertex in S . The domination number denoted by is defined to be the minimum cardinality of dominating set in G. We investigate the domination numbers of Helm graph, web graph and Levi graph. Also we testing our theoretical results in computer by introduce a matlab procedure to calculate the domination numbers , dominating set S and draw this graphs that illustrated the vertices of domination this graphs. It is proved that: