Exam 2 Review 2.1-2.5, 3.1-3.4 2.1:Coordinate Geometry 2.2: Linear
... • Be able to explain what each part of vertex form y = a(x − h)2 + k means ◦ y = x2 + k is a vertical shift ◦ y = ax2 is a stretch, scrunch, or flip depending on the value of a ◦ y = (x − h)2 is a horizontal shift • Be able to graph a parabola in vertex form • Complete the square to write f (x) = ax ...
... • Be able to explain what each part of vertex form y = a(x − h)2 + k means ◦ y = x2 + k is a vertical shift ◦ y = ax2 is a stretch, scrunch, or flip depending on the value of a ◦ y = (x − h)2 is a horizontal shift • Be able to graph a parabola in vertex form • Complete the square to write f (x) = ax ...
Document
... (solid if ≥ or ≤, dashed if < or >). This line separates the coordinate plane into 2 halves. o In one half-plane – all of the points are solutions of the inequality. o In the other half-plane - no point is a solution 2. You can decide which half to shade by testing ONE point. 3. Shade the half that ...
... (solid if ≥ or ≤, dashed if < or >). This line separates the coordinate plane into 2 halves. o In one half-plane – all of the points are solutions of the inequality. o In the other half-plane - no point is a solution 2. You can decide which half to shade by testing ONE point. 3. Shade the half that ...
Dual graph
In the mathematical discipline of graph theory, the dual graph of a plane graph G is a graph that has a vertex for each face of G. The dual graph has an edge whenever two faces of G are separated from each other by an edge. Thus, each edge e of G has a corresponding dual edge, the edge that connects the two faces on either side of e.Graph duality is a topological generalization of the geometric concepts of dual polyhedra and dual tessellations, and is in turn generalized algebraically by the concept of a dual matroid. Variations of planar graph duality include a version of duality for directed graphs, and duality for graphs embedded onto non-planar two-dimensional surfaces.However, the notion described in this page is different from the edge-to-vertex dual (line graph) of a graph and should not be confused with it.The term ""dual"" is used because this property is symmetric, meaning that if H is a dual of G, then G is a dual of H (if G is connected). When discussing the dual of a graph G, the graph G itself may be referred to as the ""primal graph"". Many other graph properties and structures may be translated into other natural properties and structures of the dual. For instance, cycles are dual to cuts, spanning trees are dual to the complements of spanning trees, and simple graphs (without parallel edges or self-loops) are dual to 3-edge-connected graphs.Polyhedral graphs, and some other planar graphs, have unique dual graphs. However, for planar graphs more generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph. Testing whether one planar graph is dual to another is NP-complete.