%0 Journal Article
%T X-INDOMINABLE GRAPHS
%A YANAMANDRAM B. VENKATAKRISHNAN
%A VENKATA SWAMINATHAN
%J Journal of Science and Arts
%D 2012
%I Bibliotheca Publishing House
%X 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.
%K X-dominating sets
%K X-independent sets
%K X-indominable number.
%U http://www.icstm.ro/DOCS/josa/josa_2012_1/a_04_Venkatakrishnan.pdf