Search Results for ""

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The exterior derivative of a function f is the one-form df=sum_(i)(partialf)/(partialx_i)dx_i (1) written in a coordinate chart (x_1,...,x_n). Thinking of a function as a ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

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 ...