Search Results for ""

A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...

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).

A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

The internal (external) bisecting plane of a dihedral angle of a tetrahedron divides the opposite edge in the ratio of the areas of the adjacent faces.

Gibrat's distribution is a continuous distribution in which the logarithm of a variable x has a normal distribution, P(x)=1/(xsqrt(2pi))e^(-(lnx)^2/2), (1) defined over the ...

A gigantic prime is a prime with 10000 or more decimal digits. The first few gigantic primes are given by 10^(9999)+n for n=33603, 55377, 70999, 78571, 97779, 131673, 139579, ...

A two-dimensional piecewise linear map defined by x_(n+1) = 1-y_n+|x_n| (1) y_(n+1) = x_n. (2) The map is chaotic in the filled region above and stable in the six hexagonal ...

Let a spherical triangle Delta have angles A, B, and C. Then the spherical excess is given by Delta=A+B+C-pi.

The girth of a graphs is the length of one of its (if any) shortest graph cycles. Acyclic graphs are considered to have infinite girth (Skiena 1990, p. 191). The girth of a ...