WebGraphs are often a natural model in real world applications such as telecommunications networks, road and transport planning, economics and social … 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.
arXiv:2005.01635v3 [math.CO] 8 Sep 2024
WebLet G be a finite non-abelian simple group and let Γ be a connected tetravalent 2-arc-transitive G-regular graph. In 2004, Fang, Li, and Xu proved that either G is normal in the … Web1 de abr. de 2007 · In this section, we will find out all connected 5-arc transitive cubic Cayley graphs for A 47. We first denote each coset G a ∈ Ω = [ A: G] by a ¯. Then Ω = T ¯ ≔ { h ¯ ∣ h ∈ T } and G is the point stabilizer of 1 ¯ in A. For any subgroup L of T and its left coset h L, the set h L ¯ is obviously an L -orbit in Ω. buttered glace
A construction of an infinite family of 2-arc transitive polygonal ...
Web24 de dez. de 2014 · On -arc-transitive graphs of order. We show that there exist functions and such that, if , and are positive integers with and is a -valent -arc-transitive graph of order with a prime, then . In other words, there are only finitely many -valent 2-arc-transitive graphs of order with and prime. This generalises a recent result of Conder, Li … 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 … Web1 de ago. de 2010 · A near-polygonal graph is a graph @C which has a set C of m-cycles for some positive integer m such that each 2-path of @C is contained in exactly one cycle in C. If m is the girth of @C then the graph is called polygonal. buttered goods