Search Results for ""

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

The backslash symbol \ is used to denote a set difference, quotient group, or integer division.

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

If G is a perfect group, then the group center of the quotient group G/Z(G), where Z(G) is the group center of G, is the trivial group.

Let a plane figure have area A and perimeter p. Then Q=(4piA)/(p^2)<=1, where Q is known as the isoperimetric quotient. The equation becomes an equality only for a circle.

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

A group G such that the quotient group G/Z(G), where Z(G) is the group center of G, is Abelian. An equivalent condition is that the commutator subgroup G^' is contained in ...

Let N be a nilpotent, connected, simply connected Lie group, and let D be a discrete subgroup of N with compact right quotient space. Then N/D is called a nilmanifold.