Search Results for ""

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

Consider the plane quartic curve X defined by x^3y+y^3z+z^3x=0, where homogeneous coordinates have been used here so that z can be considered a parameter (the plot above ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

A quartic equation is a fourth-order polynomial equation of the form z^4+a_3z^3+a_2z^2+a_1z+a_0=0. (1) While some authors (Beyer 1987b, p. 34) use the term "biquadratic ...

A surface of revolution is a surface generated by rotating a two-dimensional curve about an axis. The resulting surface therefore always has azimuthal symmetry. Examples of ...

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...