Search Results for ""

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...

A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...

There are a number of equations known as the Riccati differential equation. The most common is z^2w^('')+[z^2-n(n+1)]w=0 (1) (Abramowitz and Stegun 1972, p. 445; Zwillinger ...