Search Results for ""

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

A goodness-of-fit test for any statistical distribution. The test relies on the fact that the value of the sample cumulative density function is asymptotically normally ...

The Laplace-Carson transform F of a real-valued function f is an integral transform defined by the formula F(p)=pint_0^inftye^(-pt)f(t)dt. (1) In most cases, the function F ...

The tetragonal antiwedge is the topological class of hexahedron. It has 10 edges and 6 vertices and its faces consist of 4 triangles and 2 quadrilaterals. A tetragonal ...

Roman (1984, p. 2) describes umbral calculus as the study of the class of Sheffer sequences. Umbral calculus provides a formalism for the systematic derivation and ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...

A connex is a geometric form introduced by Clebsch (1872) that included as special cases the curve considered as a point locus and the curve considered as a line envelope ...