Digraphs Admitting Sharply Edge-transitive Automorphism Groups
نویسندگان
چکیده
منابع مشابه
Sharply 2-transitive groups
We give an explicit construction of sharply 2-transitive groups with fixed point free involutions and without nontrivial abelian normal subgroup.
متن کاملSharply 3-transitive groups
We construct the first sharply 3-transitive groups not arising from a near field, i.e. point stabilizers have no nontrivial abelian normal subgroup.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملThe automorphism groups of non-edge-transitive rose window graphs
In this paper, we will determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this will complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we deter...
متن کاملSimple tournaments and sharply transitive groups
If the relation E is transitive, i.e., if (x, y) E E and (y, z) E E imply that (x, z) E E, we speak of a transitive tournament or a total order. Clearly (Z, <) is a total order. We tend to visualize tournaments by considering every edge (x, y) E E as an arrow leading from x to y. In this sense every tournament can also be considered as a complete graph in which every edge is oriented in some di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1987
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(87)80043-4