Search Results for ""

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

Eigenvectors are a special set of vectors associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic vectors, ...

The general ellipsoid, also called a triaxial ellipsoid, is a quadratic surface which is given in Cartesian coordinates by (x^2)/(a^2)+(y^2)/(b^2)+(z^2)/(c^2)=1, (1) where ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

According to Euler's rotation theorem, any rotation may be described using three angles. If the rotations are written in terms of rotation matrices D, C, and B, then a ...

The excentral triangle, also called the tritangent triangle, of a triangle DeltaABC is the triangle J=DeltaJ_AJ_BJ_C with vertices corresponding to the excenters of DeltaABC. ...

In a given triangle DeltaABC with all angles less than 120 degrees (2pi/3, the first Fermat point X or F_1 (sometimes simply called "the Fermat point," Torricelli point, or ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

The fork graph, sometimes also called the chair graph, is the 5-vertex tree illustrated above. It could perhaps also be known as the 'h graph' (but not to be confused with ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...