Search Results for ""

The multiplicity of a multigraph is its maximum edge multiplicity.

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The Penrose triangle, also called the tribar (Cerf), tri-bar (Ernst 1987), impossible tribar (Pappas 1989, p. 13), or impossible triangle, is an impossible figure published ...

The Kähler potential is a real-valued function f on a Kähler manifold for which the Kähler form omega can be written as omega=ipartialpartial^_f. Here, the operators ...

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...