A characterization is given of a class of edge-transitive Cayley graphs, providing methods for constructing Cayley graphs with certain symmetry properties. Various new half-arc transitive graphs are constructed. © 2004 Elsevier Ltd. All rights reserved.

Nathanson was the pioneer in introducing the concepts of Number Theory, particularly, the "Theory of Congruences" in Graph Theory, thus paving way for the emergence of a new class of graphs, namely "Arithmetic Graphs". Cayley graphs are another class of graphs associated with the elements of a group. If this group is associated with some arithmetic function then the Cayley g...

It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.

Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of translation. We propose a notion of graph associated to a language, which conserves or generalizes these features. Whereas Cayley graphs are very regular; associa...

The question of which groups admit planar Cayley graphs goes back over 100 years, being settled for finite groups by Maschke in 1896. Since that time, various authors have studied infinite planar Cayley graphs which satisfy additional special conditions. We consider the question of which groups possess any planar Cayley graphs at all by categorizing such graphs according to their connectivity. ...

In this paper, we study percolation on finite Cayley graphs. A conjecture of Benjamini says that the critical percolation pc of any vertex–transitive graph satisfying a certain diameter condition can be bounded away from one. We prove Benjamini’s conjecture for some special classes of Cayley graphs. We also establish a reduction theorem, which allows us to build Cayley graphs for large groups w...

The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...

Recently the following question was relayed [1] to the second author: What is the cardinality of the set of vertex transitive graphs of finite degree? Our aim in this short note is to show that there are 20 such graphs. Our proof is constructive and is based on ideas of B. Neumann [3]. In order to construct a large such set it is natural to turn to Cayley graphs of finitely generated groups (se...

We give a nonstandard treatment of the notion of ends of proper geodesic metric spaces. We then apply this nonstandard treatment to Cayley graphs of finitely generated groups and give nonstandard proofs of many of the fundamental results concerning ends of groups. We end with an analogous nonstandard treatment of the ends of relatively Cayley graphs, that is Cayley graphs of cosets of finitely ...