Search Results for ""

The antipedal triangle DeltaA^'B^'C^' of a reference triangle DeltaABC with respect to a given point P is the triangle of which DeltaABC is the pedal triangle with respect to ...

The 13 Archimedean dual graphs are the skeletons of the Archimedean dual solids, illustrated above. Since they are polyhedral graphs, they are also planar. However, none of ...

Given a point P and a triangle DeltaABC, the Cevian triangle DeltaA^'B^'C^' is defined as the triangle composed of the endpoints of the cevians though the Cevian point P. A ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

Let the circles c_2 and c_3^' used in the construction of the Brocard points which are tangent to A_2A_3 at A_2 and A_3, respectively, meet again at D_A. The points D_AD_BD_C ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

The Euler triangle of a triangle DeltaABC is the triangle DeltaE_AE_BE_C whose vertices are the midpoints of the segments joining the orthocenter H with the respective ...

An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...

Given triangle DeltaA_1A_2A_3, let the point of intersection of A_2Omega and A_3Omega^' be B_1, where Omega and Omega^' are the Brocard points, and similarly define B_2 and ...

The triangle DeltaN_1N_2N_3 formed by joining a set of three Neuberg centers (i.e., centers of the Neuberg circles) obtained from the edges of a given triangle DeltaA_1A_2A_3 ...