Search Results for ""

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

A highly structured geometric object used to study groups which act upon them.

An antiprism graph is a graph corresponding to the skeleton of an antiprism. Antiprism graphs are therefore polyhedral and planar. The n-antiprism graph has 2n vertices and ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

Discrete Mathematics

If O_(p^')(G)=1 and if x is a p-element of G, then L_(p^')(C_G(x))<=E(C_G(x)), where L_(p^') is the p-layer.

Let A^~, B^~, ... be operators. Then the commutator of A^~ and B^~ is defined as [A^~,B^~]=A^~B^~-B^~A^~. (1) Let a, b, ... be constants, then identities include [f(x),x] = 0 ...

Theta(G;A)=<theta(a):a in A-1> is an A-invariant solvable p^'-subgroup of G.

Q is said to be tightly embedded if |Q intersection Q^g| is odd for all g in G-N_G(Q), where N_G(Q) is the normalizer of Q in G.

The p-layer of H, L_(p^')(H) is the unique minimal normal subgroup of H which maps onto E(H/O_(p^')(H)).