Search Results for ""

A octagrammic prism is a prism formed by two regular octagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...

A number of attractive 18-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 50-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

Let phi(z)=cz+c_0+c_1z^(-1)+c_2z^(-2)+... be an analytic function, regular and univalent for |z|>1, that maps |z|>1 conformally onto the region T preserving the point at ...

An ordered pair (a,b) of nonnegative integers such that there is some set of a points and b edges whose removal disconnects the graph and there is no set of a-1 nodes and b ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...