Search Results for ""

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

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...

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

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...

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

In general, a triakis tetrahedron is a non-regular dodecahedron that can be constructed as a positive augmentation of a regular tetrahedron. Such a solid is also known as a ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...