TOPICS
Search

Search Results for ""


581 - 590 of 880 for Weakly Connected DigraphSearch Results
An oriented knot is an oriented link of one component, or equivalently, it is a knot which has been given an orientation. Given an oriented knot K, reversing the orientation ...
A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...
An oriented link is a link for which each connected component has been given an orientation. As oriented links are equivalent, if there is an orientation preserving ...
A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...
An auxiliary latitude also called the reduced latitude and denoted eta or theta. It gives the latitude on a sphere of radius a for which the parallel has the same radius as ...
The golden ratio phi can be written in terms of a nested radical in the beautiful form phi=sqrt(1+sqrt(1+sqrt(1+sqrt(1+...)))), (1) which can be written recursively as ...
A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...
The n-path complement graph P^__n is the graph complement of the path graph P_n. The first few are illustrated above. Since P_4 is self-complementary, P^__4 is isomorphic to ...
The set of all lines through a point. The term was first used by Desargues (Cremona 1960, p. x). The six angles of any pencils of four rays O{ABCD} are connected by the ...
A function is said to be piecewise constant if it is locally constant in connected regions separated by a possibly infinite number of lower-dimensional boundaries. The ...
1 ... 56|57|58|59|60|61|62 ... 88 Previous Next

...