Search Results for ""

A matching is a maximum matching iff it contains no augmenting path.

The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...

A fork of a tree T is a node of T which is the endpoint of two or more branches.

The square torus is the quotient of the plane by the integer lattice.

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

A benzenoid is a fusene that is a subgraph of the regular hexagonal lattice (i.e., a simply connected polyhex). The numbers of n-hexagon benzenoids for n=1, 2, ... are 1, 1, ...

Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

For a given point lattice, some number of points will be within distance d of the origin. A Waterman polyhedron is the convex hull of these points. A progression of Waterman ...