Search Results for ""

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

A plesiohedron is the Voronoi cell of a so-called symmetric Delone set. Plesiohedra are space-filling polyhedra which have special symmetries that take any copy of the ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.