Search Results for ""

Transitivity is a result of the symmetry in the group. A group G is called transitive if its group action (understood to be a subgroup of a permutation group on a set Omega) ...

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

The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

Two points on a surface which are opposite to each other but not farthest from each other (e.g., the midpoints of opposite edges of a cube) are said to be transitive points. ...

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

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

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