Search Results for ""

The Cassini ovals are a family of quartic curves, also called Cassini ellipses, described by a point such that the product of its distances from two fixed points a distance ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

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 theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...

Every semisimple Lie algebra g is classified by its Dynkin diagram. A Dynkin diagram is a graph with a few different kinds of possible edges. The connected components of the ...

A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...