When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Y-Δ transform - Wikipedia

    en.wikipedia.org/wiki/Y-Δ_transform

    In circuit design, the Y-Δ transform, also written wye-delta and also known by many other names, is a mathematical technique to simplify the analysis of an electrical network. The name derives from the shapes of the circuit diagrams , which look respectively like the letter Y and the Greek capital letter Δ .

  3. YΔ- and ΔY-transformation - Wikipedia

    en.wikipedia.org/wiki/YΔ-_and_ΔY-transformation

    ΔY- and YΔ-transformations are a tool both in pure graph theory as well as applications. Both operations preserve a number of natural topological properties of graphs. . For example, applying a YΔ-transformation to a 3-vertex of a planar graph, or a ΔY-transformation to a triangular face of a planar graph, results again in a planar graph.

  4. List of common coordinate transformations - Wikipedia

    en.wikipedia.org/wiki/List_of_common_coordinate...

    Let (x, y, z) be the standard Cartesian coordinates, and (ρ, θ, φ) the spherical coordinates, with θ the angle measured away from the +Z axis (as , see conventions in spherical coordinates). As φ has a range of 360° the same considerations as in polar (2 dimensional) coordinates apply whenever an arctangent of it is taken. θ has a range ...

  5. Dirac delta function - Wikipedia

    en.wikipedia.org/wiki/Dirac_delta_function

    The graph of the Dirac delta is usually thought of as following the whole x-axis and the positive y-axis. [5]: 174 The Dirac delta is used to model a tall narrow spike function (an impulse), and other similar abstractions such as a point charge, point mass or electron point.

  6. Parallel single-source shortest path algorithm - Wikipedia

    en.wikipedia.org/wiki/Parallel_single-source...

    A central problem in algorithmic graph theory is the shortest path problem.One of the generalizations of the shortest path problem is known as the single-source-shortest-paths (SSSP) problem, which consists of finding the shortest paths from a source vertex to all other vertices in the graph.

  7. Geographic coordinate conversion - Wikipedia

    en.wikipedia.org/wiki/Geographic_coordinate...

    Therefore, to convert from a degrees minutes seconds format to a decimal degrees format, one may use the formula ... Note: arctan2[Y, X] is the four-quadrant inverse ...

  8. Distance-transitive graph - Wikipedia

    en.wikipedia.org/wiki/Distance-transitive_graph

    In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and ...

  9. Mathematics of three-phase electric power - Wikipedia

    en.wikipedia.org/wiki/Mathematics_of_three-phase...

    A three-phase system may be arranged in delta (∆) or star (Y) (also denoted as wye in some areas, as symbolically it is similar to the letter 'Y'). A wye system allows the use of two different voltages from all three phases , such as a 230/400 V system which provides 230 V between the neutral (centre hub) and any one of the phases, and 400 V ...