Results on the inverse majority domination and majority independence number of a graph

Abstract

In this article,the relationship between Inverse Majority Domination number ? ?1 M (G) and Majority Independence number ?M(G) of a graph G is discussed for some classes of graphs. In particular, ? ?1 M (G) and ?M(G) for cubic and cubic bipartite graph are studied with examples. Also characterization theorem for this relation and some results are determined.