Search Results for ""

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

A roulette is a curve traced by a fixed point on a closed convex curve as that curve rolls without slipping along a second curve. The roulettes described by the foci of ...

The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...

An ordinary differential equation of the form y^('')+P(x)y^'+Q(x)y=0. (1) Such an equation has singularities for finite x=x_0 under the following conditions: (a) If either ...

Separation of variables is a method of solving ordinary and partial differential equations. For an ordinary differential equation (dy)/(dx)=g(x)f(y), (1) where f(y)is nonzero ...

The Simson line is the line containing the feet P_1, P_2, and P_3 of the perpendiculars from an arbitrary point P on the circumcircle of a triangle to the sides or their ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

The point of concurrence K of the symmedians, sometimes also called the Lemoine point (in England and France) or the Grebe point (in Germany). Equivalently, the symmedian ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...