Search Results for ""

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive ...

The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...

Discrete Mathematics

How can a delegation of six regiments, each of which sends a colonel, a lieutenant-colonel, a major, a captain, a lieutenant, and a sub-lieutenant be arranged in a regular ...

A square matrix A is antihermitian if it satisfies A^(H)=-A, (1) where A^(H) is the adjoint. For example, the matrix [i 1+i 2i; -1+i 5i 3; 2i -3 0] (2) is an antihermitian ...

An antisymmetric matrix, also known as a skew-symmetric or antimetric matrix, is a square matrix that satisfies the identity A=-A^(T) (1) where A^(T) is the matrix transpose. ...

A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...