Vertex-transitive graphs and their arc-types

preprint2015arXivOpen access

Abstract

Let XX be a finite vertex-transitive graph of valency dd, and let AA be the full automorphism group of XX. Then the arc-type of XX is defined in terms of the sizes of the orbits of the action of the stabiliser AvA_v of a given vertex vv on the set of arcs incident with vv. Specifically, the arc-type is the partition of dd as the sum n1+n2+⋯+nt+(m1+m1)+(m2+m2)+⋯+(ms+ms),n_1 + n_2 + \dots + n_t + (m_1 + m_1) + (m_2 + m_2) + \dots + (m_s + m_s), where n1,n2,…,ntn_1, n_2, \dots, n_t are the sizes of the self-paired orbits, and m1,m1,m2,m2,…,ms,msm_1,m_1, m_2,m_2, \dots, m_s,m_s are the sizes of the non-self-paired orbits, in descending order. In this paper, we find the arc-types of several families of graphs. Also we 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+11+1 and (1+1)(1+1), every partition as defined above is realisable, in the sense that there exists at least one graph with the given partition as its arc-type.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.