Search Results for ""

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...

A proof that is only based on visual elements, without any comments. An arithmetic identity can be demonstrated by a picture showing a self-evident equality between numerical ...

Synergetics coordinates are a set of triangular coordinates in their plane (or their generalization to tetrahedral coordinates in space, or the analogs in higher dimensions). ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...