نتایج جستجو برای: symmetric graph

تعداد نتایج: 274107  

Journal: :Inf. Comput. 2017
Patricia Bouyer Nicolas Markey Steen Vester

We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undeci...

2017
Gabriel Verret

One version of the polycirculant conjecture states that every vertex-transitive graph has a non-identity semiregular automorphism that is, a non-identity automorphism whose cycles all have the same length. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open valency.

Journal: :Eur. J. Comb. 2008
Xin Gui Fang Lu Jun Jia Jie Wang

This paper investigates the automorphism group of a connected and undirected G-symmetric graph Γ where G is an almost simple group with socle T . First we prove that, for an arbitrary subgroup M of AutΓ containing G, either T is normal in M or T is a subgroup of the alternating group Ak of degree k = |Mα : Tα| − |NM (T ) : T |. Then we describe the structure of the full automorphism group of G-...

Journal: :J. Comb. Theory, Ser. B 2008
Stefko Miklavic Primoz Potocnik Steve Wilson

A cycle decomposition of a graph Γ is a set C of cycles of Γ such that every edge of Γ belongs to exactly one cycle in C. Such a decomposition is called arc-transitive if the group of automorphisms of Γ that preserve C setwise acts transitively on the arcs of Γ . In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining an...

2012
Marston D.E. Conder Jicheng Ma

In this sequel to the paper ‘Arc-transitive abelian regular covers of cubic graphs’, all arc-transitive abelian regular covers of the Heawood graph are found. These covers include graphs that are 1-arc-regular, and others that are 4-arc-regular (like the Heawood graph). Remarkably, also some of these covers are 2-arc-regular.

2005
SANMING ZHOU

Let be a G-symmetric graph admitting a nontrivial G-invariant partition B. Let B be the quotient graph of with respect to B. For each block B ∈ B, the setwise stabiliser G B of B in G induces natural actions on B and on the neighbourhood B(B) of B in B . Let G(B) and G[B] be respectively the kernels of these actions. In this paper we study certain “local actions” induced by G(B) and G[B], such ...

Journal: :Eur. J. Comb. 2010
Alice Devillers Michael Giudici Cai Heng Li Cheryl E. Praeger

Two different constructions are given of a rank 8 arc-transitive graphwith 165 vertices and valency 8,whose automorphismgroup isM11. One involves 3-subsets of an 11-set while the other involves 4-subsets of a 12-set, and the constructions are linkedwith theWitt designs on 11, 12 and 24 points. Four different constructions are given of a rank 9 arc-transitive graph with 55 vertices and valency 6...

2006
Yan-Quan Feng Roman Nedela

By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...

2008
Svetlana Poznanović

We give a bijection between partially directed paths in the symmetric wedge y = ±x and matchings, which sends north steps to nestings. This gives a bijective proof of a result of Prellberg et al. that was first discovered through the corresponding generating functions: the number of partially directed paths starting at the origin confined to the symmetric wedge y = ±x with k north steps is equa...

Journal: :Eur. J. Comb. 2007
Shang Jin Xu Xin Gui Fang Jie Wang Ming Yao Xu

In this paper, we determine all connected 5-arc transitive cubic Cayley graphs on the alternating group A47; there are only two such graphs (up to isomorphism). By earlier work of the authors, these are the only two nonnormal connected cubic arc-transitive Cayley graphs for finite nonbelian simple groups, and so this paper completes the classification of such non-normal Cayley graphs.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید