Search Results for ""

The double graph of a given graph G is constructed by making two copies of G (including the initial edge set of each) and adding edges u_1v_2 and v_1u_2 for every edge uv of ...

The Feigenbaum constant delta is a universal constant for functions approaching chaos via period doubling. It was discovered by Feigenbaum in 1975 (Feigenbaum 1979) while ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

The group C_2×C_2×C_2 is one of the three Abelian groups of order 8 (the other two groups are non-Abelian). An example is the modulo multiplication group M_(24) (which is the ...

C_2×C_4 is one of the three Abelian groups of group order 8 (the other two being non-Abelian). Examples include the modulo multiplication groups M_(15), M_(16), M_(20), and ...

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 graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

The frame bundle on a Riemannian manifold M is a principal bundle. Over every point p in M, the Riemannian metric determines the set of orthonormal frames, i.e., the possible ...

Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...

The girth of a graphs is the length of one of its (if any) shortest graph cycles. Acyclic graphs are considered to have infinite girth (Skiena 1990, p. 191). The girth of a ...