Search Results for ""

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

A quadratic form Q(z) is said to be positive definite if Q(z)>0 for z!=0. A real quadratic form in n variables is positive definite iff its canonical form is ...

An algebraic integer of the form a+bsqrt(D) where D is squarefree forms a quadratic field and is denoted Q(sqrt(D)). If D>0, the field is called a real quadratic field, and ...

The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

The small triambic icosahedron is the dual polyhedron of the small ditrigonal icosidodecahedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. ...

A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices. The spherical triangle is the ...

While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...