Search Results for ""

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...

A curve with polar coordinates, r=b+asectheta (1) studied by the Greek mathematician Nicomedes in about 200 BC, also known as the cochloid. It is the locus of points a fixed ...

Connect-Four is a tic-tac-toe-like two-player game in which players alternately place pieces on a vertical board 7 columns across and 6 rows high. Each player uses pieces of ...

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

Cubic nonhamiltonian graphs are nonhamiltonian graphs that are also cubic. The numbers of connected cubic nonhamiltonian graphs on n=10, 12, ... nodes are 2, 5, 35, 219, ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...