enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Block graph - Wikipedia

    en.wikipedia.org/wiki/Block_graph

    Every tree, cluster graph, or windmill graph is a block graph. Every block graph has boxicity at most two. [7] Block graphs are examples of pseudo-median graphs: for every three vertices, either there exists a unique vertex that belongs to shortest paths between all three vertices, or there exists a unique triangle whose edges lie on these ...

  3. Building (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Building_(mathematics)

    The Bruhat–Tits tree for the 2-adic Lie group SL(2,Q 2). The notion of a building was invented by Jacques Tits as a means of describing simple algebraic groups over an arbitrary field. Tits demonstrated how to every such group G one can associate a simplicial complex Δ = Δ(G) with an action of G, called the spherical building of G.

  4. Unit distance graph - Wikipedia

    en.wikipedia.org/wiki/Unit_distance_graph

    Where the terminology may be ambiguous, the graphs in which non-edges must be a non-unit distance apart may be called strict unit distance graphs [3] or faithful unit distance graphs. [2] The subgraphs of unit distance graphs are equivalently the graphs that can be drawn in the plane using only one edge length. [ 4 ]

  5. Taxicab geometry - Wikipedia

    en.wikipedia.org/wiki/Taxicab_geometry

    Taxicab geometry or Manhattan geometry is geometry where the familiar Euclidean distance is ignored, and the distance between two points is instead defined to be the sum of the absolute differences of their respective Cartesian coordinates, a distance function (or metric) called the taxicab distance, Manhattan distance, or city block distance.

  6. Planar graph - Wikipedia

    en.wikipedia.org/wiki/Planar_graph

    In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. [1] [2] Such a drawing is called a plane graph, or a planar embedding of the graph.

  7. Distance from a point to a line - Wikipedia

    en.wikipedia.org/wiki/Distance_from_a_point_to_a...

    In the case of a line in the plane given by the equation ax + by + c = 0, where a, b and c are real constants with a and b not both zero, the distance from the line to a point (x 0,y 0) is [1] [2]: p.14

  8. Distance (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Distance_(graph_theory)

    The latter may occur even if the distance in the other direction between the same two vertices is defined. In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them. This is also known as the geodesic distance or shortest-path ...

  9. Distance between two parallel lines - Wikipedia

    en.wikipedia.org/wiki/Distance_between_two...

    the distance between the two lines is the distance between the two intersection points of these lines with the perpendicular line y = − x / m . {\displaystyle y=-x/m\,.} This distance can be found by first solving the linear systems