Determining the minimum dominating set in connected graphs is one of most difficult problems defined as NP-hard. In this problem, it aimed to determine important nodes that can influence all via number on graph. study, an efficient near optimal algorithm showing a deterministic approach has been developed different from approximation algorithms mentioned literature for discovering set. The O(n3...