Search Results for ""

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...

Let Pi(x) be the rectangle function, then the Fourier transform is F_x[Pi(x)](k)=sinc(pik), where sinc(x) is the sinc function.

The regularized gamma functions are defined by P(a,z) = (gamma(a,z))/(Gamma(a)) (1) Q(a,z) = (Gamma(a,z))/(Gamma(a)), (2) where gamma(a,z) and Gamma(a,z) are incomplete gamma ...

The Shi-Krotov-Solé graph is a weakly regular graph on 1024 vertices with regular parameters (nu,k,lambda,mu)=(1024,33,2,(0,2)). It is distance-regular but not ...

The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...

A function f(z) is said to be doubly periodic if it has two periods omega_1 and omega_2 whose ratio omega_2/omega_1 is not real. A doubly periodic function that is analytic ...

The great snub dodecicosidodecahedral graph is the skeleton of the great snub dodecicosidodecahedron, illustrated above in a few embeddings. It will be implemented in a ...

A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...