Search Results for ""

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...

erf(z) is the "error function" encountered in integrating the normal distribution (which is a normalized form of the Gaussian function). It is an entire function defined by ...

A number x in which the first n decimal digits of the fractional part frac(x) sum to 666 is known as an evil number (Pegg and Lomont 2004). However, the term "evil" is also ...

A fixed point is a point that does not change upon application of a map, system of differential equations, etc. In particular, a fixed point of a function f(x) is a point x_0 ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The fork graph, sometimes also called the chair graph, is the 5-vertex tree illustrated above. It could perhaps also be known as the 'h graph' (but not to be confused with ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...