Search Results for ""

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. Starting with 1, the sequence would be defined by "1, ...

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

Let alpha(z),gamma(z):(a,b)->R^3 be curves such that |gamma|=1 and alpha·gamma=0, and suppose that alpha and gamma have holomorphic extensions alpha,gamma:(a,b)×(c,d)->C^3 ...

Let a knot K be parameterized by a vector function v(t) with t in S^1, and let w be a fixed unit vector in R^3. Count the number of local minima of the projection function ...

A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...

Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...

Gauss's continued fraction is given by the continued fraction ...

The Higman-Sims group is the sporadic group HS of order |HS| = 44352000 (1) = 2^9·3^2·5^3·7·11. (2) The Higman-Sims group is 2-transitive, and has permutation representations ...