Search Results for ""

Let 0<p_1<p_2<... be integers and suppose that there exists a lambda>1 such that p_(j+1)/p_j>lambda for j=1, 2, .... Suppose that for some sequence of complex numbers {a_j} ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

If G is a weighted tree with weights w_i>1 assigned to each vertex v_i, then G is perfectly weighted if the matrix M_G=[w_1 0 ... 0; 0 w_2 ... 0; | ... ... |; 0 0 ... ...

A function f(x) is said to be periodic (or, when emphasizing the presence of a single period instead of multiple periods, singly periodic) with period p if f(x)=f(x+np) for ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A permutation matrix is a matrix obtained by permuting the rows of an n×n identity matrix according to some permutation of the numbers 1 to n. Every row and column therefore ...

Given two intersecting lines OA and OB forming an angle with vertex at O and a point X inside the angle ∠AOB, the Philo line (or Philon line) is the shortest line segment AB ...

There exist polyhedra which can be plaited (braided). Examples include a plaited cube and plaited icosahedron illustrated above (Pargeter 1959, Wells 1991). In the above ...

A polyare is a polyform formed from a polyomino by removing of half of each square such that at least half of the original join between squares is retained. The first few ...

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...