Search Results for ""

Minimal surfaces are defined as surfaces with zero mean curvature. A minimal surface parametrized as x=(u,v,h(u,v)) therefore satisfies Lagrange's equation, ...

A polyomino is a generalization of the domino to a collection of n squares of equal size arranged with coincident sides. Polyominos were originally called "super-dominoes" by ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...

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 pyramidal frustum is a frustum made by chopping the top off a pyramid. It is a special case of a prismatoid. For a right pyramidal frustum, let s be the slant height, h the ...