Search Results for ""

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 ...

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.

A polyiamond consisting of equilateral triangles 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.

A graph with graph edges of two possible "colors," usually identified as red and blue. For a bichromatic graph with R red graph edges and B blue graph edges, R+B>=2.