The Absolute Superiority of the Direct Product of Graphs Is Shown at Both the Upper and Lower Limits. the Limits Include the Total Number {2} For Dominance, the Total Number 2 Times For Dominance and the Factors' Number For Open Packing. Those Relationships Have an Exact Total Number of Supremacy. a Set of Graphs Reveals That the Limits Are Best Feasible. the Number of Direct Graphics Products Dominating. We Show That the Step Domination Number of any Tree T Satisfies Where N Is the Number of Vertices of T, an D D Is Its Diameter. It Is Also Proved That If some Requirements Are Set Ona Tree T Then,