Search Results for ""

The three planes determined by the edges of a trihedron and the internal bisectors of the respectively opposite faces are coaxal, and the common line of these planes is ...

A flow line for a map on a vector field F is a path sigma(t) such that sigma^'(t)=F(sigma(t)).

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

A line and a plane are parallel if they do not intersect.

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron. It is implemented in the Wolfram ...

Given an arrangement of points, a line containing just two of them is called an ordinary line. Dirac (1951) conjectured that every sufficiently set of n noncollinear points ...

A line along a normal vector (i.e., perpendicular to some tangent line). If K subset R^d is a centrosymmetric set which has a twice differentiable boundary, then there are ...

The Nagel line is the term proposed for the first time in this work for the line on which the incenter I, triangle centroid G, Spieker center Sp, and Nagel point Na lie. ...

The line R[s]=1/2 in the complex plane on which the Riemann hypothesis asserts that all nontrivial (complex) Riemann zeta function zeros lie. The plot above shows the first ...