Search Results for ""

The Parry point is one of the two intersections of the Parry circle and the circumcircle of a triangle (the other is the focus of the Kiepert parabola, which is Kimberling ...

Let L, M, and N be lines through A, B, C, respectively, parallel to the Euler line. Let L^' be the reflection of L in sideline BC, let M^' be the reflection of M in sideline ...

A removable singularity is a singular point z_0 of a function f(z) for which it is possible to assign a complex number in such a way that f(z) becomes analytic. A more ...

A single-valued function is function that, for each point in the domain, has a unique value in the range. It is therefore one-to-one or many-to-one. A single-valued complex ...

A basin of attraction in which every point on the common boundary of that basin and another basin is also a boundary of a third basin. In other words, no matter how closely a ...

The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. The hexacode graph is a ...

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

The Shi-Krotov-Solé graph is a weakly regular graph on 1024 vertices with regular parameters (nu,k,lambda,mu)=(1024,33,2,(0,2)). It is distance-regular but not ...

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...