Search Results for ""

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

For an ellipse with parametric equations x = acost (1) y = bsint, (2) the negative pedal curve with respect to the origin has parametric equations x_n = ...

Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).

The angle of incidence of a ray to a surface is measured as the difference in angle between the ray and the normal vector of the surface at the point of intersection.

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

Lee (1944) defines an authalic map projection to be one in which at any point the scales in two orthogonal directions are inversely proportional.