Volume :3 , Issue :3 ,Page :136-141

Abstract :The graphs considered in this paper are finite , simple, connected and un directed. In this paper, first we derive the lower bound for all graphs with maximum degree  , which are free from cycles of length three and four, from which we deduce the lower bound for domination number for all graphs.