Search Results for ""

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

The dual of the great cubicuboctahedron and Wenninger dual W_(77).

A method for predicting the onset of widespread chaos. It is based on the hypothesis that the dissolution of an invariant torus can be associated with the sudden change from ...

A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

Let |A| be an n×n determinant with complex (or real) elements a_(ij), then |A|!=0 if |a_(ii)|>sum_(j=1; j!=i)^n|a_(ij)|.

There exists a system of distinct representatives for a family of sets S_1, S_2, ..., S_m iff the union of any k of these sets contains at least k elements for all k from 1 ...

The contour C_epsilon illustrated above.

A diagram expressing how the gluing operation that connects the handlebodies involved in a Heegaard splitting proceeds, usually by showing how the meridians of the handlebody ...

An irregular dodecahedron which is also a trapezohedron.