Search Results for ""

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

A homotopy from one embedding of a manifold M in N to another such that at every time, it is an embedding. The notion of isotopy is category independent, so notions of ...

A tubular neighborhood of a submanifold N in M is an embedding of the normal bundle (nu_N) of N into M, i.e., f:nu_N->M, where the image of the zero section of the normal ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...

A double-toroidal graph is a graph with graph genus 2 (West 2000, p. 266). Planar and toroidal graphs are therefore not double-toroidal. Some known double-toroidal graphs on ...

In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...

A pretzel graph is a graph with graph genus 3 (West 2000, p. 266). Planar, toroidal graphs, and double-toroidal graphs are therefore not pretzel. Examples of pretzel graphs ...

Robertson's apex graph is the 15-vertex graph illustrated above constructed by Neil Robertson as an example of an apex graph that is not YDeltaY-reducible. The graph may be ...

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