Search Results for ""
1171 - 1180 of 1693 for Rook GraphsSearch Results
Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...
A Ramsey number of the form R(k,k;2).
It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...
If G^' is a subgraph of G, then G is said to be a supergraph of G^'.
Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...
A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...
Betti numbers are topological objects which were proved to be invariants by Poincaré, and used by him to extend the polyhedral formula to higher dimensional spaces. ...
In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...
...
View search results from all Wolfram sites (7197 matches)

