Search Results for ""

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

Given a reference triangle DeltaABC, the trilinear coordinates of a point P with respect to DeltaABC are an ordered triple of numbers, each of which is proportional to the ...

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

An alternating knot is a knot which possesses a knot diagram in which crossings alternate between under- and overpasses. Not all knot diagrams of alternating knots need be ...

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 ...

An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...