Search Results for ""

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

A similarity transformation which transforms each line to a parallel line whose length is a fixed multiple of the length of the original line. The simplest dilation is ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

A ruled surface is called a right conoid if it can be generated by moving a straight line intersecting a fixed straight line such that the lines are always perpendicular ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

A heptahedral graph is a polyhedral graph on seven nodes. There are 34 nonisomorphic heptahedral graphs, as first enumerated by Kirkman (1862-1863) and Hermes (1899ab, 1900, ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

Given a point P and a line AB, draw the perpendicular through P and call it PC. Let PD be any other line from P which meets CB in D. In a hyperbolic geometry, as D moves off ...

A theorem stated in 1882 which cannot be derived from Euclid's postulates. Given points a, b, c, and d on a line, if it is known that the points are ordered as (a,b,c) and ...

The point-slope form of a line through the point (x_1,y_1) with slope m in the Cartesian plane is given by y-y_1=m(x-x_1).