The vertex-transitive TLF-planar graphs

We consider the class of the topologically locally finite (in short TLF) planar vertex-transitive graphs, a class containing in particular all the one-ended planar Cayley graphs and the normal transitive tilings. We characterize these graphs with a finite local representation and a special kind of finite state automaton named labeling scheme. As a result, we are able to enumerate and describe all TLF-planar vertex-transitive graphs of any given degree. Also, we are able decide to whether any TLF-planar transitive graph is Cayley or not.Comment: Article : 23 pages, 15 figures Appendix : 13 pages, 72 figures Submitted to Discrete Mathematics The appendix is accessible at http://www.labri.fr/~renault/research/research.htm

Vertex-primitive groups and graphs of order twice the product of two distinct odd primes

A non-Cayley number is an integer n for which there exists a vertex-transitive graph on n vertices which is not a Cayley graph. In this paper, we complete the determination of the non-Cayley numbers of the form 2pq, where p, q are distinct odd primes. Earlier work of Miller and the second author had dealt with all such numbers corresponding to vertex-transitive graphs admitting an imprimitive subgroup of automorphisms. This paper deals with the primitive case. First the primitive permutation groups of degree 2pq are classified. This depends on the finite simple group classification. Then each of these groups G is examined to determine whether there are any non-Cayley graphs which admit G as a vertex-primitive subgroup of automorphisms, and admit no imprimitive subgroups. The outcome is that 2pq is a non-Cayley number, where