TOPICS
Search

Search Results for ""


1811 - 1820 of 4468 for Point Line DistanceSearch Results
If a plane cuts the sides AB, BC, CD, and DA of a skew quadrilateral ABCD in points P, Q, R, and S, then (AP)/(PB)·(BQ)/(QC)·(CR)/(RD)·(DS)/(SA)=1 both in magnitude and sign ...
If any set of points is displaced by X^idx_i where all distance relationships are unchanged (i.e., there is an isometry), then the vector field is called a Killing vector. ...
An obelisk is a stone pillar erected as a monument that usually consists of a pyramid atop a tall square (or sometimes rectangular base). The elongated square pyramid can ...
A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...
The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...
There are several commonly used methods of defining the slippery, but extremely important, concept of a continuous function (which, depending on context, may also be called a ...
The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...
The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...
Given a circle expressed in trilinear coordinates by a central circle is a circle such that l:m:n is a triangle center and k is a homogeneous function that is symmetric in ...
"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...
1 ... 179|180|181|182|183|184|185 ... 447 Previous Next

...