Search Results for ""

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 ...

If lim_(k->infty)u_k!=0, then the series {u_n} diverges.

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

Distinguish between smooth manifolds in four dimensions.

In the American system, 10^(39).

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...

Johnson solid J_9.

A point, such as interior points of a disk, such that (px)(py)=[const], where p is the chord length.

If A=>B and B=>A (i.e., A=>B ^ B=>A, where => denotes implies), then A and B are said to be equivalent, a relationship which is written symbolically in this work as A=B. The ...