Search Results for ""

Given a group with elements A and X, there must be an element B which is a similarity transformation of A,B=X^(-1)AX so A and B are conjugate with respect to X. Conjugate ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

A measure algebra which has many properties associated with the convolution measure algebra of a group, but no algebraic structure is assumed for the underlying space.

A game in which the possible moves are the same for each player in any position. All positions in all impartial games form an additive Abelian group. For impartial games in ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The kernel of a ring homomorphism f:R-->S is the set of all elements of R which are mapped to zero. It is the kernel of f as a homomorphism of additive groups. It is an ideal ...

Let R be a ring, let A be a subring, and let B be an ideal of R. Then A+B={a+b:a in A,b in B} is a subring of R, A intersection B is an ideal of A and (A+B)/B=A/(A ...

A semiring is a set together with two binary operators S(+,*) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive ...

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...