Search Results for ""

A prismatoid having planar sides and the same number of vertices in both of its parallel planes. The faces of a prismoid are therefore either trapezoids or parallelograms. ...

The square antiprism is the antiprism with square bases whose dual is the tetragonal trapezohedron. The square antiprism has 10 faces. The square antiprism with unit edge ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

A dipyramid, also called a bipyramid, consists of two pyramids symmetrically placed base-to-base. The dipyramids are duals of the regular prisms. Their skeletons are the ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines. The two ...

A number which is simultaneously octagonal and triangular. Let O_n denote the nth octagonal number and T_m the mth triangular number, then a number which is both octagonal ...

A circle packing is called rigid (or "stable") if every circle is fixed by its neighbors, i.e., no circle can be translated without disturbing other circles of the packing ...