Search Results for ""

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...

There are two types of singular values, one in the context of elliptic integrals, and the other in linear algebra. For a square matrix A, the square roots of the eigenvalues ...

If a matrix A has a matrix of eigenvectors P that is not invertible (for example, the matrix [1 1; 0 1] has the noninvertible system of eigenvectors [1 0; 0 0]), then A does ...

In general, a singularity is a point at which an equation, surface, etc., blows up or becomes degenerate. Singularities are often also called singular points. Singularities ...

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

The Smale horseshoe map consists of a sequence of operations on the unit square. First, stretch in the y direction by more than a factor of two, then compress in the x ...

The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...

A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...