Search Results for ""

The Johnson graph J(n,k) has vertices given by the k-subsets of {1,...,n}, with two vertices connected iff their intersection has size k-1. Special classes are summarized in ...

A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...

Suppose that A and B are two algebras and M is a unital A-B-bimodule. Then [A M; 0 B]={[a m; 0 b]:a in A,m in M,b in B} with the usual 2×2 matrix-like addition and ...

The augmented triangular prism is Johnson solid J_(49), which is formed from augmentation of one of the lateral faces of an equilateral triangular prism by an equilateral ...

A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...

The triangular orthobicupola is Johnson solid J_(27), consisting of eight equilateral triangles and six squares. If a triangular orthobicupola is oriented with triangles on ...

An upper triangular matrix U is defined by U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... ...

The triangular cupola is Johnson solid J_3. Its faces consist of 4 equilateral triangles, 3 squares, and 1 hexagon. It is implemented in the Wolfram Language as ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...