Search Results for ""

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...

The Sobolev embedding theorem is a result in functional analysis which proves that certain Sobolev spaces W^(k,p)(Omega) can be embedded in various spaces including ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...

The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...