Search Results for ""

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

A homogeneous ideal I in a graded ring R= direct sum A_i is an ideal generated by a set of homogeneous elements, i.e., each one is contained in only one of the A_i. For ...

Schur (1916) proved that no matter how the set of positive integers less than or equal to |_n!e_| (where |_x_| is the floor function) is partitioned into n classes, one class ...

A Julia set fractal obtained by iterating the function z_(n+1)=c(z_n-sgn(R[z_n])), where sgn(x) is the sign function and R[z] is the real part of z. The plot above sets ...

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

Doob (1996) defines a stochastic process as a family of random variables {x(t,-),t in J} from some probability space (S,S,P) into a state space (S^',S^'). Here, J is the ...

Integers (lambda,mu) for a and b that satisfy Bézout's identity lambdaa+mub=GCD(a,b) are called Bézout numbers. For integers a_1, ..., a_n, the Bézout numbers are a set of ...

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

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