Search Results for ""

Tutte's (46-vertex) graph is a cubic nonhamiltonian graph contructed by Tutte (1946) as a counterexample to Tait's Hamiltonian graph conjecture by using three copies ...

A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...

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 cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...

A phenomenological law also called the first digit law, first digit phenomenon, or leading digit phenomenon. Benford's law states that in listings, tables of statistics, ...

A circle is the set of points in a plane that are equidistant from a given point O. The distance r from the center is called the radius, and the point O is called the center. ...

The conic sections are the nondegenerate curves generated by the intersections of a plane with one or two nappes of a cone. For a plane perpendicular to the axis of the cone, ...

The derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...

A hyperbola (plural "hyperbolas"; Gray 1997, p. 45) is a conic section defined as the locus of all points P in the plane the difference of whose distances r_1=F_1P and ...