Web28 de out. de 2009 · An arc-transitive graph Γ is said to be (X, s)-regular if it is (X, s)-arc-transitive and, for any two s-arcs of Γ, there is a unique automorphism of Γ mapping one … Web1 de mar. de 2001 · It is proved that if Γ is a finite connected s-transitive graph (where s ≥ 2) of order a p-power with p prime, then s = 2 or 3; further, either s = 3 and Γ is a normal …
A construction of an infinite family of 2-arc transitive polygonal ...
Webarc-transitive graphs with vertex stabilizer D8 and order 10752, with 10752 being the smallest order of connected tetravalent half-arc-transitive graphs with vertex stabilizer … Web9 de abr. de 2024 · When the underlying graphs exhibit a significant girth and expanding factor, ... Then they are called edge-transitive Cayley graphs such that Lemma 4 of is satisfied ... Chou, P.-C., & Ueng, Y.-L. (2024). An effective low-complexity error-floor lowering technique for high-rate QC-LDPC codes. IEEE Communications Letters, 22(10 ... greek city menu clearwater
Open Research Online
Web1 de mai. de 1989 · Highly Arc Transitive Digraphs. Finite digrahs Г with a group G of automorphisms acting transitively on the set of s -arcs, for some s ⩾ 2, are investigated. For each valency v and each s ⩾ 2 an infinite family of finite digraphs of valency v which are s -arc transitive but not ( s + 1)-arc transitive are constructed. Webinitial 3-arc will not be equivalent under any automorphism. 13(*). Let G be a distance transitive graph with girth at least five. Let k = 1. Then G is at least k-arc transitive. Consider any two k+1-arcs (they may be taken to start from the same vertex x because G is vertex-transitive). If they have an edge in common, then k-arc Web1 de mar. de 2024 · It is proved that every such graph, with the exception of the Desargues graph on 20 vertices, is either a skeleton of a hexagonal tiling of the torus, the skeleton … greek city music