Search Results for ""

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...

Bit rate (i.e., bits per second, abbreviated bps) is a measure of the number of data bits (digital 0s and 1s) transmitted each second in a digital communications channel. If ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...