Search Results for ""

A single-valued function is function that, for each point in the domain, has a unique value in the range. It is therefore one-to-one or many-to-one. A single-valued complex ...

The spherical distance between two points P and Q on a sphere is the distance of the shortest path along the surface of the sphere (paths that cut through the interior of the ...

An unduloid, also called an onduloid, is a surface of revolution with constant nonzero mean curvature. It is a roulette obtained from the path described by the foci of a ...

Whirls are figures constructed by nesting a sequence of polygons (each having the same number of sides), each slightly smaller and rotated relative to the previous one. The ...

A diagram lemma which states that every short exact sequence of chain complexes and chain homomorphisms 0-->C-->^phiD-->^psiE-->0 gives rise to a long exact sequence in ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...

A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...

A graph is a forbidden topological minor (also known as a forbidden homeomorphic subgraph) if its presence as a homeomorphic subgraph of a given graph (i.e., there is an ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...