paper

On distance two in Cayley graphs of Coxeter groups

arXiv:1404.1479

Abstract

We consider the Cayley graph of a Coxeter system and describe all maximal -cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to . As an application, we show that every automorphism of the half of Cayley graph is uniquely extendable to an automorphism of the Cayley graph if .

On distance two in Cayley graphs of Coxeter groups · wovepaper