Search Results for ""

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The Gauss-Seidel method (called Seidel's method by Jeffreys and Jeffreys 1988, p. 305) is a technique for solving the n equations of the linear system of equations Ax=b one ...

Applying the stellation process to the icosahedron gives 20+30+60+20+60+120+12+30+60+60 cells of 11 different shapes and sizes (including the icosahedron itself). The ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

The common incircle of the medial triangle DeltaM_AM_BM_C (left figure) and the congruent triangle DeltaQ_AQ_BQ_C, where Q_i are the midpoints of the line segment joining the ...

The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

The Jacobi symbol (a/y)=chi(y) as a number theoretic character can be extended to the Kronecker symbol (f(a)/y)=chi^*(y) so that chi^*(y)=chi(y) whenever chi(y)!=0. When y is ...

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

The Narayana triangle is the number triangle obtained from the Narayana numbers N(n,k), namely 1 ; 1 1 ; 1 3 1 ; 1 6 6 1 ; 1 10 20 10 1 ; 1 15 50 50 15 1 (OEIS A001263).