Search Results for ""

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...

A square matrix that is not singular, i.e., one that has a matrix inverse. Nonsingular matrices are sometimes also called regular matrices. A square matrix is nonsingular iff ...

A square matrix A is a normal matrix if [A,A^(H)]=AA^(H)-A^(H)A=0, where [a,b] is the commutator and A^(H) denotes the conjugate transpose. For example, the matrix [i 0; 0 ...

By way of analogy with the eban numbers, oban numbers are defined as numbers whose English names do not contain the letter "o" (i.e., "o" is banned). Note that this ...

An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...

An odd permutation is a permutation obtainable from an odd number of two-element swaps, i.e., a permutation with permutation symbol equal to -1. For initial set {1,2,3,4}, ...

An odious number is a nonnegative number that has an odd number of 1s in its binary expansion. The first few odious numbers are therefore 1, 2, 4, 7, 8, 11, 13, 14, 16, 19, ...

In the equianharmonic case of the Weierstrass elliptic function, corresponding to invariants g_2=0 and g_3=1, the corresponding real half-period is given by omega_2 = ...

The omega constant is defined as W(1)=0.5671432904... (1) (OEIS A030178), where W(x) is the Lambert W-function. It is available in the Wolfram Language using the function ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...