Search Results for ""

The second Morley triangle is made by rotating line BC toward vertex A about vertex B by angle (B+2pi)/3. It is an equilateral triangle. It has trilinear vertex matrix [1 ...

The third Morley triangle is made by rotating line BC toward vertex A about vertex B by angle (B+4pi)/3. It is an equilateral triangle. It has trilinear vertex matrix [1 ...

Let P_i=x_i:y_i:z_i be trilinear points for i=1, 2, 3. The A-vertex of the unary cofactor triangle is then defined as the point y_2z_3-z_2y_3:z_2x_3-x_2z_3:x_2y_3-y_2x_3, and ...

The arithmetic-geometric energy of a graph is defined as the graph energy of its arithmetic-geometric matrix, i.e., the sum of the absolute values of the eigenvalues of its ...

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...