Search Results for ""
1991 - 2000 of 4167 for Line GraphSearch Results
An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...
The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...
Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...
The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...
Sylvester's four-point problem asks for the probability q(R) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester ...
Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...
Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.
Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...
The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...
Isomorphism is a very general concept that appears in several areas of mathematics. The word derives from the Greek iso, meaning "equal," and morphosis, meaning "to form" or ...
...
View search results from all Wolfram sites (32492 matches)

