Search Results for ""

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

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

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

The finite group T is one of the three non-Abelian groups of order 12 (out of a total of fives groups of order 12), the other two being the alternating group A_4 and the ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

An outer-totalistic cellular automaton is a generalization of the totalistic cellular automaton. Totalistic rules are a proper superset of outer-totalistic rules. In ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

The order of the polynomial defining an algebraic curve.

A 19-sided polygon, sometimes also called the enneakaidecagon.