6-5 Graphing Linear Equations

... Graph the point (x1,y1) Use slope (as a fraction) to find your next point - rise/ run from the point ...

... Graph the point (x1,y1) Use slope (as a fraction) to find your next point - rise/ run from the point ...

Quadratic Function - Crest Ridge R-VII

... a, b, and c are called the coefficients. The graph will form a parabola. Each graph will have either a maximum or minimum point. There is a line of symmetry which will divide the graph into two halves. ...

... a, b, and c are called the coefficients. The graph will form a parabola. Each graph will have either a maximum or minimum point. There is a line of symmetry which will divide the graph into two halves. ...

6.3 – Graphing Sine and Cosine Functions

... What is the range? Set of real numbers between -1 and 1 What is the period? 2π Where are all the x-intercepts? at πn, where n is any integer Where is the y-intercept? at (0, 0) Where are the maximums? At y = 1 and occur when x = π/2 + 2πn Where are the minimums? At y = -1 and occur when x = 3π/2 + 2 ...

... What is the range? Set of real numbers between -1 and 1 What is the period? 2π Where are all the x-intercepts? at πn, where n is any integer Where is the y-intercept? at (0, 0) Where are the maximums? At y = 1 and occur when x = π/2 + 2πn Where are the minimums? At y = -1 and occur when x = 3π/2 + 2 ...

Name_______________________ January 19, 2016 Review for

... What is the fifteenth term of the geometric sequence ...

... What is the fifteenth term of the geometric sequence ...

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.