CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search For Dominating set problem, see Dominating set . 1 dom 1 2 3 4 5 6 2 dom 2 3 4 5 6 3 dom 3 4 dom 4 5 dom 5 6 dom 6 Corresponding domination relation Grey nodes are not strictly dominated Red nodes are immediately dominated Example control flow graph with entry node 1. In computer science , in control flow graphs , a node d dominates a node n if every path from the entry node to n must go through d . Notationally, this is written as d dom n (or sometimes d n ). By definition, every node dominates itself. There are a number of related concepts: A node d strictly dominates a node n if d dominates n and d does not equal n. The immediate dominator or idom of a node n is the unique node that strictly dominate...