Vertex-transitive digraphs with extra automorphisms that preserve the natural arc-colouring

نویسندگان

  • Ted Dobson
  • Ademir Hujdurovic
  • Klavdija Kutnar
  • Joy Morris
چکیده

In a Cayley digraph on a group G, if a distinct colour is assigned to each arc-orbit under the left-regular action of G, it is not hard to show that the elements of the left-regular action of G are the only digraph automorphisms that preserve this colouring. In this paper, we show that the equivalent statement is not true in the most straightforward generalisation to G-vertex-transitive digraphs, even if we restrict the situation to avoid some obvious potential problems. Specifically, we display an infinite family of 2-closed groups G, and a G-arc-transitive digraph on each (without any digons) for which there exists an automorphism of the digraph that is not an element of G (it is an automorphism of G). Since the digraph is G-arc-transitive, the arcs would all be assigned the same colour under the colouring by arc-orbits, so this digraph automorphism is colour-preserving.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A census of 4-valent half-arc-transitive graphs and arc- transitive digraphs of valence two

A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a 12 -arc-transitive group of automorphisms on up to 1000 vertices is obtained. Several graph-theoretical properties of the elements of our census are calculated and discussed.

متن کامل

Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms

A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertex-transitive digraph of order pk or mp, where p is a prime, k 1 and m p are positive integers, has a sem...

متن کامل

Automorphisms of groups and isomorphisms of Cayley digraphs

Let G be a graph and S a subset of G not ,",VLLCU,lJ.HHF-, element of The of G with respect to is a directed graph with vertex set G and for x and y in there is an arc from x to y if and only if x-1y E S. In this paper, we discuss the between the isomorphisms of D(G, S) and the automorphisms of G. The results to studying the and automorphisms of hierarchical digraphs of abelian groups. For any ...

متن کامل

Surjective H-Colouring over Reflexive Digraphs

The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theo...

متن کامل

A note on arc-transitive circulant digraphs

We prove that, for a positive integer n and subgroup H of automorphisms of a cyclic group Z of order n, there is up to isomorphism a unique connected circulant digraph based on Z admitting an arc-transitive action of ZzH. We refine the Kovács–Li classification of arc-transitive circulants to determine those digraphs with automorphism group larger than ZzH. As an application we construct, for ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2017