MINIMUM TOTAL DOMINATING SETS OF CARTESIAN PRODUCTS OF PATHS

A set S of vertices in a graph G(V,E) is called a dominating set if every vertex uЄV is either an element of S or is adjacent to an element of S. A set S of vertices in a graph G(V,E) is called a total dominating set if every vertex uЄV isadjecent to an element of S. The domination number of a graph G denoted by y(G) is the minimum cardinality of a dominating set in G. respectively the total domination number of a graph G denoted by yt(G) is the minimum cardinality of a total dominating set in G.

Keywords:

dominating set , total dominating set , total domination number