Search Results for ""

Differential Equations

A solid of revolution is a solid enclosing the surface of revolution obtained by rotating a 1-dimensional curve, line, etc. about an axis. A portion of a solid of revolution ...

A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...

There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).