Search Results for ""

An outer measure mu on R^n is Borel regular if, for each set X subset R^n, there exists a Borel set B superset X such that mu(B)=mu(X). The d-dimensional Hausdorff outer ...

A regular local ring is a local ring R with maximal ideal m so that m can be generated with exactly d elements where d is the Krull dimension of the ring R. Equivalently, R ...

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

Consider a two-dimensional tessellation with q regular p-gons at each polygon vertex. In the plane, (1-2/p)pi=(2pi)/q (1) 1/p+1/q=1/2, (2) so (p-2)(q-2)=4 (3) (Ball and ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...