X-INDOMINABLE GRAPHS

An X-dominating set which is also X-independent is called an X-independent X-dominating set. A graph is said to be X-indominable if X(G) can be partitioned into X-independent X-dominating sets, otherwise G is called X-indominable. We define X-indominable number and give its bipartite version.