Vertex-transitive graphs and their arc-types

Arjana Žitnik
University of Ljubljana and IMFM

Marston Conder
Department of Mathematics, University of Auckland

Tomaž Pisanski
University of Primorska

PDF

Minisymposium: STRUCTURE AND PROPERTIES OF VERTEX-TRANSITIVE GRAPHS

Content: Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the {\em arc-type\/} of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex $v$ on the set of arcs incident with $v$. Specifically, the arc-type is the partition of $d$ as the sum $n_1 + n_2 + \dots + n_t + (m_1 + m_1) + (m_2 + m_2) + \dots + (m_s + m_s)$, where $n_1, n_2, \dots, n_t$ are the sizes of the self-paired orbits, and $m_1,m_1, m_2,m_2, \dots, m_s,m_s$ are the sizes of the non-self-paired orbits, in descending order. We find the arc-types of several interesting families of graphs. We also show that the arc-type of a Cartesian product of two `relatively prime' graphs is the natural sum of their arc-types. Then using these observations, we show that with the exception of $1+1$ and $(1+1)$, every partition as defined above is \emph{realisable}, in the sense that there exists at least one graph with the given partition as its arc-type.

Back to all abstracts