Tetravalent Graphs Admitting Half-Transitive Group Actions: Alternating Cycles
نویسندگان
چکیده
In this paper we study finite, connected, 4-valent graphs X which admit an action of a group G which is transitive on vertices and edges, but not transitive on the arcs of X. Such a graph X is said to be (G, 1 2)-transitive. The group G induces an orientation of the edges of X, and a certain class of cycles of X (called alternating cycles) determined by the group G is identified as having an important influence on the structure of X. The alternating cycles are those in which consecutive edges have opposite orientations. It is shown that X is a cover of a finite, connected, 4-valent, (G, 1 2)-transitive graph for which the alternating cycles have one of three additional special properties, namely they are tightly attached, loosely attached, or antipodally attached. We give examples with each of these special attachment properties, and moreover we complete the classification (begun in a separate paper by the first author) of the tightly attached examples. 1999 Academic Press
منابع مشابه
Constructing even radius tightly attached half-arc-transitive graphs of valency four
A finite graph X is half-arc-transitive if its automorphism group is transitive on vertices and edges, but not on arcs. When X is tetravalent, the automorphism group induces an orientation on the edges and a cycle of X is called an alternating cycle if its consecutive edges in the cycle have opposite orientations. All alternating cycles of X have the same length and half of this length is calle...
متن کاملBridging Semisymmetric and Half-arc-transitive Actions on Graphs
A generalization of some of the Folkman's constructions [13] of the so called semisymmetric graphs, that is regular graphs which are edgebut not vertex-transitive, was given in [22] together with a natural connection of graphs admitting 12 -arc-transitive group actions and certain graphs admitting semisymmetric group actions. This connection is studied in more detail in this paper. In Theorem 2...
متن کاملBridging Semisymmetric and Half-Arc-Transitive Actions on Graphs
A generalization of some of Folkman’s constructions (see (1967) J. Comb. Theory, 3, 215–232) of the so-called semisymmetric graphs, that is regular graphs which are edgebut not vertex-transitive, was given by Marušič and Potočnik (2001, Europ. J. Combinatorics, 22, 333–349) together with a natural connection between graphs admitting 1 2 -arc-transitive group actions and certain graphs admitting...
متن کاملFinite Graphs of Valency 4 and Girth 4 Admitting Half - Transitive Group
Finite graphs of valency 4 and girth 4 admitting 1 2-transitive group actions, that is vertex-and edge-but not arc-transitive group actions, are investigated. A graph is said to be 1 2-transitive if its automorphism group acts 1 2-transitively. There is a natural (balanced) orientation of the edge set of a 1 2-transitive graph induced and preserved by its auto-morphism group. Among others it is...
متن کاملTetravalent half-arc-transitive graphs of order p4
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arctransitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p − 1 is divisible by 8 and it is unique for a given o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 75 شماره
صفحات -
تاریخ انتشار 1999