Search Results for ""

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The hemiobelisk graph is the skeleton of the hemiobelisk. It has 7 vertices, 11 edges, and 6 faces. It is a minimal unit-distance forbidden graph. It is implemented in the ...

The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...

The Pasch configuration is the unbalanced (6_2,4_3) configuration (since there are two lines through each of six points and three points on each of four lines) illustrated ...

The pentagonal wedge graph is the skeleton of the pentagonal wedge. It is a has 8 vertices, 12 edges, and 6 faces. The pentagonal wedge graph is implemented in the Wolfram ...

The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...

A function f is Carathéodory differentiable at a if there exists a function phi which is continuous at a such that f(x)-f(a)=phi(x)(x-a). Every function which is Carathéodory ...

A function element is an ordered pair (f,U) where U is a disk D(Z_0,r) and f is an analytic function defined on U. If W is an open set, then a function element in W is a pair ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...