Search Results for ""

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...

A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3+uv^2+2(u^2-v^2). (3) The handkerchief surface has stationary points summarized in ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...