Search Results for ""

A two-dimensional generalization of the Haar transform which is used for the compression of astronomical images. The algorithm consists of dividing the 2^N×2^N image into ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

There are no fewer than three distinct notions of the term local C^*-algebra used throughout functional analysis. A normed algebra A=(A,|·|_A) is said to be a local ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

The set of all lines through a point. The term was first used by Desargues (Cremona 1960, p. x). The six angles of any pencils of four rays O{ABCD} are connected by the ...

The regular octagon is the regular polygon with eight sides, as illustrated above. The inradius r, circumradius R, and area A of the regular octagon can be computed directly ...

Consider a two-dimensional tessellation with q regular p-gons at each polygon vertex. In the plane, (1-2/p)pi=(2pi)/q (1) 1/p+1/q=1/2, (2) so (p-2)(q-2)=4 (3) (Ball and ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

A sheaf is a presheaf with "something" added allowing us to define things locally. This task is forbidden for presheaves in general. Specifically, a presheaf F on a ...