Search Results for ""

An Aztec diamond of order n is the region obtained from four staircase shapes of height n by gluing them together along the straight edges. It can therefore be defined as the ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

A number of the form Tt_n=((n+2; 2); 2)=1/8n(n+1)(n+2)(n+3) (Comtet 1974, Stanley 1999), where (n; k) is a binomial coefficient. The first few values are 3, 15, 45, 105, 210, ...

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

Two adjoined rotundas.

A figurate number in which layers of polygons are drawn centered about a point instead of with the point at a polygon vertex.

A gadget defined for complex vector bundles. The Chern classes of a complex manifold are the Chern classes of its tangent bundle. The ith Chern class is an obstruction to the ...