Search Results for ""

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

Given a principal bundle pi:A->M, with fiber a Lie group G and base manifold M, and a group representation of G, say phi:G×V->V, then the associated vector bundle is ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

Given a group G, the algebra CG is a vector space CG={suma_ig_i|a_i in C,g_i in G} of finite sums of elements of G, with multiplication defined by g·h=gh, the group ...

For any sets A and B, their cardinal numbers satisfy |A|<=|B| iff there is a one-to-one function f from A into B (Rubin 1967, p. 266; Suppes 1972, pp. 94 and 116). It is easy ...