Search Results for ""
1571 - 1580 of 2352 for Complete GraphSearch Results
Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...
A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...
The twin composites may be defined by analogy with the twin primes as pairs of composite numbers (n,n+2). Since all even number are trivially twin composites, it is natural ...
An ascending chain of subspaces of a vector space. If V is an n-dimensional vector space, a flag of V is a filtration V_0 subset V_1 subset ... subset V_r, (1) where all ...
A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...
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 (20139 matches)

