In this paper, a characterisation is given of finite s-arc transitive Cayley graphs with s ≥ 2. In particular, it is shown that, for any given integer k with k ≥ 3 and k ≠ 7, there exists a finite set ...

It would be interesting to find a vertex transitive graph whose matching polynomial has a nonsimple root. Such a graph would not have a hamiltonian path (see [1,2]) and would disprove a conjecture of ...

We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, that is, graphs with edges viewed as line segments or more general sets ...