TOPICS
Search

Search Results for ""


281 - 290 of 455 for symmetricSearch Results
A Cartan matrix is a square integer matrix who elements (A_(ij)) satisfy the following conditions. 1. A_(ij) is an integer, one of {-3,-2,-1,0,2}. 2. A_(ii)=2 the diagonal ...
Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...
A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...
Let V be an n-dimensional linear space over a field K, and let Q be a quadratic form on V. A Clifford algebra is then defined over T(V)/I(Q), where T(V) is the tensor algebra ...
Covariance provides a measure of the strength of the correlation between two or more sets of random variates. The covariance for two random variates X and Y, each with sample ...
A cubic spline is a spline constructed of piecewise third-order polynomials which pass through a set of m control points. The second derivative of each polynomial is commonly ...
The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...
The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...
A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...
A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...
1 ... 26|27|28|29|30|31|32 ... 46 Previous Next

...