Bridging semisymmetric and half-arc-transitive actions on graphs
The central topic of the paper are the semisymmetric graphs and the \(\frac{1}{2}\)-arc-transitive graphs. A graph is said to be \(\frac{1}{2}\)-arc-transitive if it is vertex-transitive, edge-transitive but not arc-transitive and a graph is said to be semisymmetric if it is a regular graph which is edge- but not vertex-transitive. The study of semisymmetric graphs has been initiated by \textit{J. Folkman} [J. Comb. Theory 3, 215-231 (1967; Zbl 0158.42501)] who gave a construction of several infinite families of such graphs. A generalization of Folkman's construction of semisymmetric graphs was given by the present authors [Eur. J. Comb. 22, 333-249 (2001; Zbl 0979.05056)]. They found a natural connection between graphs admitting \(\frac{1}{2}\)-arc-transitive group actions and certain graphs admitting semisymmetric group actions. The main purpose of the present article is to study this connection. A sufficient condition for the semisymmetry of the so-called generalized Folkman graphs arising from certain graphs admitting a \(\frac{1}{2}\)-arc-transitive group action is given in Section 2 of the paper (Theorem 2.1). In Section 3 the concepts of alter-sequence and alter-exponent for a general digraph are introduced and studied in great detail; their definitions are too technical to be produced here. These tools are then used in Section 4 to study the interplay of three classes of graphs: (1) cubic graphs admitting a one-regular group action, (2) the corresponding line graphs which admit a \(\frac{1}{2}\)-arc-transitive action of the same group, and (3) the associated generalized Folkman graphs. At the end in Section 5 an open problem is posed, suggesting an in-depth analysis of the structure of tetravalent \(\frac{1}{2}\)-arc-transitive graphs with alter-exponent 2.
- Semisymmetry of generalized Folkman graphs
- scientific article; zbMATH DE number 5008078
- A class of bipartite 2-path-transitive graphs
- A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two
- On edge-transitive Cayley graphs of valency four
- A �-transitive graph of valency 4 with a nonsolvable group of automorphisms
- Some recent discoveries about half-arc-transitive graphs
- Classifying cubic semisymmetric graphs of order \(18p^n\)
- There exists no tetravalent half-arc-transitive graph of order \(2p^{2}\)
- Two-arc-transitive graphs of odd order. II
- A classification of semisymmetric graphs of order 2pq
- A One-Regular Graph of Degree Three
- A �-transitive graph of valency 4 with a nonsolvable group of automorphisms
- An Edge but not Vertex Transitive Cubic Graph*
- Finite graphs of valency 4 and girth 4 admitting half-transitive group actions
- Half-transitive group actions on finite graphs of valency 4
- scientific article; zbMATH DE number 4023321 (Why is no real title available?)
- scientific article; zbMATH DE number 3745208 (Why is no real title available?)
- scientific article; zbMATH DE number 193034 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3286093 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- Maps and half-transitive graphs of valency 4
- On edge but not vertex transitive regular graphs
- On the Classification of Symmetric Graphs with a Prime Number of Vertices
- Regular groups of automorphisms of cubic graphs
- Regular line-symmetric graphs
- Semisymmetry of generalized Folkman graphs
- Tetravalent graphs admitting half-transitive group actions: Alternating cycles
- Vertex-primitive graphs of order a product of two distinct primes
- Homogeneous factorisations of graphs and digraphs
- On the order of arc-stabilizers in arc-transitive graphs
- Four constructions of highly symmetric tetravalent graphs
- Recipes for edge-transitive tetravalent graphs
- The separated box product of two digraphs
- On the vertex-stabiliser in arc-transitive digraphs
- On tetravalent half-arc-transitive graphs of girth 5
- On biprimitive semisymmetric graphs
- Classification of vertex-transitive digraphs of order a product of two distinct primes via automorphism group
- An infinite family of half-arc-transitive graphs with universal reachability relation
- Reachability relations in digraphs
This page was built for publication: Bridging semisymmetric and half-arc-transitive actions on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864586)
