Search Results for ""

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.

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

There are several definitions of a ray. When viewed as a vector, a ray is a vector AB^-> from a point A to a point B. In geometry, a ray is usually taken as a half-infinite ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.