Search Results for ""

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...

The biharmonic operator, also known as the bilaplacian, is the differential operator defined by del ^4=(del ^2)^2, where del ^2 is the Laplacian. In n-dimensional space, del ...

The parameter r (sometimes also denoted mu) in the logistic equation x_(n+1)=rx_n(1-x_n).

A fractal produced by iteration of the equation z_(n+1)=z_n^2 (mod m) which results in a Moiré-like pattern.

K=(dT)/(ds), where T is the tangent vector defined by T=((dx)/(ds))/(|(dx)/(ds)|).

A 70-sided polygon.

While an equality A=B states that two mathematical expressions are equal, an inequation A!=B states that two expressions are not equal.

Approximates the possible values of y in terms of x if sum_(i,j=0)^na_(ij)x^iy^j=0.