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

A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...

The plane figure formed by a sequence of circles C_1, C_2, C_3, ... that are all tangent to each other at the same point and such that the sequence of radii converges to ...

A square matrix U is a unitary matrix if U^(H)=U^(-1), (1) where U^(H) denotes the conjugate transpose and U^(-1) is the matrix inverse. For example, A=[2^(-1/2) 2^(-1/2) 0; ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

A square matrix A is a special orthogonal matrix if AA^(T)=I, (1) where I is the identity matrix, and the determinant satisfies detA=1. (2) The first condition means that A ...