Search Results for ""

An n-component of a graph G is a maximal n-connected subgraph.

For a simple continued fraction x=[a_0,a_1,...] with convergents p_n/q_n, the fundamental recurrence relation is given by p_nq_(n-1)-p_(n-1)q_n=(-1)^(n+1).

A Ramsey number of the form R(k,k;2).

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

The Dürer graph is the skeleton of Dürer's solid, which is the generalized Petersen graph GP(6,2). It is illustrated above in a number of embeddings. It is implemented in the ...

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...

A graph that is not finite is called infinite.