Search Results for ""

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

The points on a line can be put into a one-to-one correspondence with the real numbers.

The roulette of the pole of a hyperbolic spiral rolling on a straight line is a tractrix.

A line segment where two faces of a polyhedron meet, also called a side.

The slope b of a line obtained using linear least squares fitting is called the regression coefficient.

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Two curves both containing the point P are tangent at P if they share the same tangent line at P.