Search Results for ""

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

Abstractly, a spatial configuration F is said to possess rotational symmetry if F remains invariant under the group C=C(F). Here, C(F) denotes the group of rotations of F and ...

The small triambic icosahedron is the dual polyhedron of the small ditrigonal icosidodecahedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. ...

A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points lying on a ...

The universal cover of a connected topological space X is a simply connected space Y with a map f:Y->X that is a covering map. If X is simply connected, i.e., has a trivial ...

The nonconservation of adiabatic invariants which arises in systems with three or more degrees of freedom.

The Balaban 10-cage is one of the three (3,10)-cage graphs (Read and Wilson 1998, p. 272). The Balaban (3,10)-cage was the first known example of a 10-cage (Balaban 1973, ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...