In this paper we discuss the relation between independent set and dominating set of
finite simple graphs . In particular, we discuss them for some cubic bipartite graphs
and find that the domination number is less than 1/3 of the number of vertices and
independence number is half of the same.