Search Results for ""

A function f is topologically transitive if, given any two intervals U and V, there is some positive integer k such that f^k(U) intersection V!=emptyset. Vaguely, this means ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

A mathematical relationship transforming a function f(x) to the form f(x+a).

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.