transitively's Usage Examples:

Every orbit is an invariant subset of X on which G acts transitively.

saying this are that the group of automorphisms of the polytope acts transitively on its vertices, or that the vertices lie within a single symmetry orbit.

group G is a non-empty manifold or topological space X on which G acts transitively.

polyhedron), or a tiling, is isotoxal or edge-transitive if its symmetries act transitively on its edges.

In other words, a graph is symmetric if its automorphism group acts transitively on ordered pairs of adjacent vertices (that is, upon edges considered.

other words, a graph is edge-transitive if its automorphism group acts transitively on its edges.

subgroup of every point acts transitively on the remaining points.

Equivalently, a group G {\displaystyle G} acts 2-transitively on a set S {\displaystyle.

group acts transitively upon ordered pairs of adjacent vertices Edge-transitive graph, a graph whose automorphism group acts transitively upon its edges.

space for a group G is a non-empty set X on which G acts freely and transitively (meaning that, for any x, y in X, there exists a unique g in G such that.

mathematics, in the field of group theory, a subgroup of a group is said to be transitively normal in the group if every normal subgroup of the subgroup is also.

other words, a graph is vertex-transitive if its automorphism group acts transitively on its vertices.

(the affine E ~ 8 {\displaystyle {\tilde {E}}_{8}} Weyl group) acts transitively on the k-faces for k ≤ 6.

that the group of automorphisms that fixes every point of the line acts transitively on the points of the plane not on the line.

triacontahedron is face-transitive, meaning the symmetry group of the solid acts transitively on the set of faces.

other words, a graph is half-transitive if its automorphism group acts transitively upon both its vertices and its edges, but not on ordered pairs of linked.

Prepositions marked with an asterisk can be used transitively or intransitively.

though their faces are regular polygons and their symmetry groups act transitively on their vertices.

Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and.

acts n-transitively on X, then the n-fold diagonal subgroup acts transitively on Xn.

More generally, for an integer k, if G acts kn-transitively on X,.