Search Results for ""

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

The Brocard axis is the line KO passing through the symmedian point K and circumcenter O of a triangle, where the segment OK is the Brocard diameter (Kimberling 1998, p. ...

In general, "a" calculus is an abstract theory developed in a purely formal way. "The" calculus, more properly called analysis (or real analysis or, in older literature, ...

A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

The dihedral group D_3 is a particular instance of one of the two distinct abstract groups of group order 6. Unlike the cyclic group C_6 (which is Abelian), D_3 is ...

Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are r(1) = 1 (1) r(2) = 1 (2) r(3) = ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...