Search Results for ""

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

pi has decimal expansion given by pi=3.141592653589793238462643383279502884197... (1) (OEIS A000796). The following table summarizes some record computations of the digits of ...

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

A ring in the mathematical sense is a set S together with two binary operators + and * (commonly interpreted as addition and multiplication, respectively) satisfying the ...

A circle is the set of points in a plane that are equidistant from a given point O. The distance r from the center is called the radius, and the point O is called the center. ...

The derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

The nine-point circle, also called Euler's circle or the Feuerbach circle, is the circle that passes through the perpendicular feet H_A, H_B, and H_C dropped from the ...