Search Results for ""

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

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 ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

A point-to-line and line-to-point transformation which transforms points A into lines a^' and lines b into points B^' such that a^' passes through B^' iff A^' lies on b.

The pedal coordinates of a point P with respect to the curve C and the pedal point O are the radial distance r from O to P and the perpendicular distance p from O to the line ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...

Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...

A fixed point for which the stability matrix has both eigenvalues negative, so lambda_1<lambda_2<0.

A fixed point for which the stability matrix has both eigenvalues positive, so lambda_1>lambda_2>0.