Search Results for ""

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

Let I(x,y) denote the set of all vertices lying on an (x,y)-graph geodesic in G, then a set S with I(S)=V(G) is called a geodetic set in G and is denoted g(G).

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...

Analytic continuation gives an equivalence relation between function elements, and the equivalence classes induced by this relation are called global analytic functions.

The gnomonic projection is a nonconformal map projection obtained by projecting points P_1 (or P_2) on the surface of sphere from a sphere's center O to point P in a plane ...

An illusion in which the eye alternately sees two black faces, or a white goblet.

A golden rhombohedron is a rhombohedron whose faces consist of congruent golden rhombi. Golden rhombohedra are therefore special cases of a trigonal trapezohedron as well as ...

Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...

Two distinct knots cannot have the same exterior. Or, equivalently, a knot is completely determined by its knot exterior (Cipra 1988; Adams 1994, p. 261). The question was ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...