Search Results for ""

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

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

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

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

The shortest path-spanning tree from a graph vertex of a 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 tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

One of the ranges into which data in a frequency distribution table (or histogram) are binned. The ends of a class interval are called class limits, and the middle of an ...

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

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