TOPICS
Search

Search Results for ""


1561 - 1570 of 2186 for k Connected GraphSearch Results
The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...
The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...
A k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...
Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...
A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...
The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...
Calabi-Yau spaces are important in string theory, where one model posits the geometry of the universe to consist of a ten-dimensional space of the form M×V, where M is a four ...
The circumradius of a cyclic polygon is a radius of the circle inside which the polygon can be inscribed. Similarly, the circumradius of a polyhedron is the radius of a ...
A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...
Given a sequence {a_n}_(n=1)^infty, a formal power series f(s) = sum_(n=1)^(infty)(a_n)/(n^s) (1) = a_1+(a_2)/(2^s)+(a_3)/(3^s)+... (2) is called the Dirichlet generating ...
1 ... 154|155|156|157|158|159|160 ... 219 Previous Next

...