Search Results for ""

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...

The symmedial triangle DeltaK_AK_BK_C (a term coined here for the first time), is the triangle whose vertices are the intersection points of the symmedians with the reference ...

The lines AK_A, BK_B, and CK_C which are isogonal to the triangle medians AM_A, BM_B, and CM_C of a triangle are called the triangle's symmedian. The symmedians are ...

The set of elements belonging to one but not both of two given sets. It is therefore the union of the complement of A with respect to B and B with respect to A, and ...

Symmetry operations include the improper rotation, inversion operation, mirror plane, and rotation. Together, these operations create 32 crystal classes corresponding to the ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

The Szilassi polyhedron is a heptahedron that is topologically equivalent to a torus and for which every pair of faces has a polygon edge in common. The Szilassi polyhedron ...

A topological space fulfilling the T_2-axiom: i.e., any two points have disjoint neighborhoods. In the terminology of Alexandroff and Hopf (1972), a T_2-space is called a ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...