Search Results for ""

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

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

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