Search Results for ""

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

If, in the above commutative diagram of modules and module homomorphisms the columns and two upper rows are exact, then so is the bottom row.

A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.

A generalization of the helicoid to the parametric equations x(u,v) = avcosu (1) y(u,v) = bvsinu (2) z(u,v) = cu. (3) In this parametrization, the surface has first ...

A point p on a regular surface M in R^3 is said to be elliptic if the Gaussian curvature K(p)>0 or equivalently, the principal curvatures kappa_1 and kappa_2 have the same ...

Given a spheroid with equatorial radius a and polar radius c, the ellipticity is defined by e={sqrt((a^2-c^2)/(a^2)) c<a (oblate spheroid); sqrt((c^2-a^2)/(c^2)) c>a (prolate ...

The second-order ordinary differential equation (x^2y^')^'+x^2y^n=0.

An endogenous variable is an economic variable that is related to other economic variables and determines their equilibrium levels.

The problem of determining (or counting) the set of all solutions to a given problem.