Search Results for ""

An International Standard Book Number (ISBN) is a code used to uniquely identify a book together. It also uniquely encodes the book's publisher and includes information about ...

Graph Strength

The number of inward directed graph edges from a given graph vertex in a directed graph.

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...