Search Results for ""

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

Wagner's theorem states that a graph is planar iff it does not contain K_5 or K_(3,3) as a graph minor.

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

A real vector bundle pi:E->M has an orientation if there exists a covering by trivializations U_i×R^k such that the transition functions are vector space ...

The Cauchy remainder is a different form of the remainder term than the Lagrange remainder. The Cauchy remainder after n terms of the Taylor series for a function f(x) ...

A plane partition whose solid Ferrers diagram is invariant under the rotation which cyclically permutes the x-, y-, and z-axes. Macdonald's plane partition conjecture gives a ...

A method of determining coefficients alpha_k in a power series solution y(x)=y_0(x)+sum_(k=1)^nalpha_ky_k(x) of the ordinary differential equation L^~[y(x)]=0 so that ...

The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...