Search Results for ""

A matching is a maximum matching iff it contains no augmenting path.

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

It is possible to place 7 cigarettes in such a way that each touches every other if l/d>7sqrt(3)/2 (Gardner 1959, p. 115).

The encrypted form of a plaintext.

Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.

Code 177 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

Code 2040 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

Code 912 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).