Search Results for ""

A Sheffer sequence for (1,f(t)) is called the associated sequence for f(t), and a sequence s_n(x) of polynomials satisfying the orthogonality conditions ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...

The property of certain algorithms that accurate answers are returned for well-conditioned problems, and the inaccuracy of the answers returned for ill-conditioned problems ...

A polyhex consisting of hexagons arranged along a line.

One baud is defined as the state of a signal in a communication channel changing once per second.

Baud rate is a measure of the number of times per second a signal in a communications channel changes state. The state is usually voltage level, frequency, or phase angle.

The 4-polyhex illustrated above.

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.