Search Results for ""

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...

For a graph G and a subset S^t of the vertex set V(G), denote by N_G^t[S^t] the set of vertices in G which are adjacent to a vertex in S^t. If N_G^t[S^t]=V(G), then S^t is ...

A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...