Search Results for ""

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The doubly truncated Witt graph is the graph on 330 vertices related to a 3-(22,8,12) design (Brouwer et al. 1989, p. 367). The doubly truncated Witt graph can be constructed ...

Every semisimple Lie algebra g is classified by its Dynkin diagram. A Dynkin diagram is a graph with a few different kinds of possible edges. The connected components of the ...

If A=>B and B=>A (i.e., A=>B ^ B=>A, where => denotes implies), then A and B are said to be equivalent, a relationship which is written symbolically in this work as A=B. The ...

Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...

Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

The great rhombicosidodecahedro is the 62-faced Archimedean solid with faces 30{4}+20{6}+12{10}. It is also known as the rhombitruncated icosidodecahedron, and is sometimes ...