Search Results for ""

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

A theorem which effectively describes how lengths, areas, volumes, and generalized n-dimensional volumes (contents) are distorted by differentiable functions. In particular, ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

A compact manifold is a manifold that is compact as a topological space. Examples are the circle (the only one-dimensional compact manifold) and the n-dimensional sphere and ...

The constant a_(-1) in the Laurent series f(z)=sum_(n=-infty)^inftya_n(z-z_0)^n (1) of f(z) about a point z_0 is called the residue of f(z). If f is analytic at z_0, its ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

Find a square number x^2 such that, when a given integer h is added or subtracted, new square numbers are obtained so that x^2+h=a^2 (1) and x^2-h=b^2. (2) This problem was ...

The Coulomb wave function is a special case of the confluent hypergeometric function of the first kind. It gives the solution to the radial Schrödinger equation in the ...