ON DOT-CRITICAL AND (y,k)- CRITICAL DOMINATION OF GRAPHS

A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. If such a graph G has domination number k, we call it k-dot-critical. A graph G is said (y,k)-critical if y(G-S) < (G) for any set S of k vertices and domination number y. We find a bound for diameter of the circulant graph Cn+1(1,4) are verfied.

Keywords:

domination , dot-critical , (y , k)-critical , dimeter