Search Results for ""

A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

A finite group L is quasisimple if L=[L,L] and L/Z(L) is a simple group.

A property of finite simple groups which is known for all such groups.

Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...

The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...

The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...

To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...