Search Results for ""

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

There are at least two maps known as the Hénon map. The first is the two-dimensional dissipative quadratic map given by the coupled equations x_(n+1) = 1-alphax_n^2+y_n (1) ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

Fok (1946) and Hazewinkel (1988, p. 65) call v(z) = 1/2sqrt(pi)Ai(z) (1) w_1(z) = 2e^(ipi/6)v(omegaz) (2) w_2(z) = 2e^(-ipi/6)v(omega^(-1)z), (3) where Ai(z) is an Airy ...

The atom-spiral, also known as the atomic spiral, is the curve with polar equation r=theta/(theta-a) for a real parameter a (van Maldeghem 2002). When theta is allows to vary ...

If, in two solids of equal altitude, the sections made by planes parallel to and at the same distance from their respective bases are always equal, then the volumes of the ...

A circular sector is a wedge obtained by taking a portion of a disk with central angle theta<pi radians (180 degrees), illustrated above as the shaded region. A sector with ...

Determining the length of a country's coastline is not as simple as it first appears, as first considered by L. F. Richardson (1881-1953) and sometimes known as the ...