Search Results for ""

Related to one another by a homomorphism.

A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual graph edge.

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

Definitions about a set which depend on the entire set.

A word or string which is not admissible.

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

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

The Johnson graph J(n,k) has vertices given by the k-subsets of {1,...,n}, with two vertices connected iff their intersection has size k-1. Special classes are summarized in ...

A theory of Hamiltonian cycles.